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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:13:30,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:13:30,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:13:30,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:13:30,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:13:30,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:13:30,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:13:30,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:13:30,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:13:30,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:13:30,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:13:30,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:13:30,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:13:30,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:13:30,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:13:30,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:13:30,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:13:30,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:13:30,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:13:30,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:13:30,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:13:30,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:13:30,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:13:30,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:13:30,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:13:30,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:13:30,390 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:13:30,391 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:13:30,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:13:30,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:13:30,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:13:30,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:13:30,394 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:13:30,394 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:13:30,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:13:30,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:13:30,396 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:13:30,422 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:13:30,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:13:30,424 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:13:30,424 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:13:30,424 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:13:30,424 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:13:30,425 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:13:30,425 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:13:30,425 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:13:30,425 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:13:30,425 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:13:30,425 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:13:30,426 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:13:30,426 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:13:30,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:13:30,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:13:30,427 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:13:30,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:13:30,429 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:13:30,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:13:30,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:13:30,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:13:30,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:13:30,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:13:30,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:13:30,431 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:13:30,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:13:30,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:13:30,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:13:30,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:13:30,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:13:30,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:13:30,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:13:30,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:13:30,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:13:30,433 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:13:30,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:13:30,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:13:30,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:13:30,434 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:13:30,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:13:30,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:13:30,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:13:30,504 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:13:30,505 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:13:30,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-01-11 11:13:30,506 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-01-11 11:13:30,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:13:30,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:13:30,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:13:30,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:13:30,556 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:13:30,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:13:30,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:13:30,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:13:30,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:13:30,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/1) ... [2019-01-11 11:13:30,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:13:30,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:13:30,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:13:30,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:13:30,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (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:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:13:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:13:30,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:13:31,090 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:13:31,090 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-11 11:13:31,092 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:13:31 BoogieIcfgContainer [2019-01-11 11:13:31,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:13:31,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:13:31,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:13:31,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:13:31,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:30" (1/2) ... [2019-01-11 11:13:31,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd86a58 and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:13:31, skipping insertion in model container [2019-01-11 11:13:31,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:13:31" (2/2) ... [2019-01-11 11:13:31,100 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-01-11 11:13:31,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:13:31,122 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-11 11:13:31,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-11 11:13:31,192 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:13:31,192 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:13:31,192 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:13:31,193 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:13:31,193 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:13:31,193 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:13:31,193 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:13:31,193 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:13:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-11 11:13:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 11:13:31,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:31,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 11:13:31,231 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:31,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:31,239 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-11 11:13:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:31,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:31,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:31,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:31,435 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-11 11:13:31,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:13:31,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:13:31,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:31,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:13:31,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:13:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:13:31,460 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-11 11:13:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:31,686 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-11 11:13:31,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:31,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 11:13:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:31,702 INFO L225 Difference]: With dead ends: 29 [2019-01-11 11:13:31,702 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:13:31,706 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-11 11:13:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:13:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-11 11:13:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 11:13:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-11 11:13:31,742 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-11 11:13:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:31,743 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-11 11:13:31,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:13:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-11 11:13:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:31,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:31,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:31,745 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-11 11:13:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:31,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:31,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:31,878 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-11 11:13:31,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:31,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:31,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:31,883 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-11 11:13:31,935 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:31,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:32,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:32,007 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:32,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:32,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:32,013 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) [2019-01-11 11:13:32,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:32,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:32,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:32,204 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 11:13:32,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,229 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-11 11:13:32,457 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-11 11:13:32,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,502 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-11 11:13:32,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:13:32,768 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-11 11:13:32,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,827 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-11 11:13:32,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:13:32,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:33,013 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 26 treesize of output 40 [2019-01-11 11:13:33,038 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 28 treesize of output 54 [2019-01-11 11:13:33,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:33,185 INFO L303 Elim1Store]: Index analysis took 129 ms [2019-01-11 11:13:33,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:13:33,190 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,363 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,391 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,416 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,431 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,446 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:33,526 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:33,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,616 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-11 11:13:33,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,659 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-11 11:13:33,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:33,732 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-11 11:13:33,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:33,769 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-11 11:13:33,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:33,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:33,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:33,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:33,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:33,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:33,791 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-11 11:13:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:34,249 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-11 11:13:34,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:34,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:13:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:34,251 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:13:34,251 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:13:34,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:13:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-11 11:13:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 11:13:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-11 11:13:34,261 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-11 11:13:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:34,261 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-11 11:13:34,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-11 11:13:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:34,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:34,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:34,262 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-11 11:13:34,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:34,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:34,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:34,334 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-11 11:13:34,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:34,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:34,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:34,335 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-11 11:13:34,337 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:34,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:34,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:34,349 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:34,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:34,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:34,350 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-11 11:13:34,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:34,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:34,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:34,426 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 21 treesize of output 24 [2019-01-11 11:13:34,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 24 treesize of output 30 [2019-01-11 11:13:34,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,448 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 26 treesize of output 40 [2019-01-11 11:13:34,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,462 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 28 treesize of output 54 [2019-01-11 11:13:34,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:34,504 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 32 treesize of output 71 [2019-01-11 11:13:34,505 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,567 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,595 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,781 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-11 11:13:34,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,862 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-11 11:13:34,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:13:35,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,045 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-11 11:13:35,046 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,063 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,084 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,101 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,136 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 1 xjuncts. [2019-01-11 11:13:35,137 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:35,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,240 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-11 11:13:35,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,273 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-11 11:13:35,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:35,303 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-11 11:13:35,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:35,317 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-11 11:13:35,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:13:35,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:13:35,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:35,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:35,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:35,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:35,336 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-11 11:13:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:35,415 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-11 11:13:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:13:35,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 11:13:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:35,416 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:13:35,416 INFO L226 Difference]: Without dead ends: 22 [2019-01-11 11:13:35,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-11 11:13:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-11 11:13:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:13:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-11 11:13:35,424 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-11 11:13:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:35,424 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-11 11:13:35,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-11 11:13:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:35,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:35,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:35,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-11 11:13:35,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:35,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:35,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:35,548 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-11 11:13:35,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:35,549 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:35,549 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-11 11:13:35,551 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:35,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:35,558 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:35,558 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:35,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:35,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,559 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-11 11:13:35,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:35,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:35,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:35,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:13:35,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,675 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 58 treesize of output 67 [2019-01-11 11:13:35,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,871 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-11 11:13:35,872 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 46 treesize of output 72 [2019-01-11 11:13:35,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:13:36,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:13:36,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,089 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,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, 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 24 [2019-01-11 11:13:36,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:36,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:13:36,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:36,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:36,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:36,345 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,394 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,415 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,431 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,573 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:36,642 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-11 11:13:36,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:13:36,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:36,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-11 11:13:36,868 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-11 11:13:36,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:36,881 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-11 11:13:36,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:36,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:36,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:36,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:36,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:36,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:36,901 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-11 11:13:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:37,081 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-01-11 11:13:37,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:13:37,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:13:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:37,083 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:13:37,084 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 11:13:37,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 11:13:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-11 11:13:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:13:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-01-11 11:13:37,091 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-01-11 11:13:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:37,091 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-01-11 11:13:37,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-01-11 11:13:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:37,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:37,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:37,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-11 11:13:37,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:37,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:37,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:37,195 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-11 11:13:37,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:37,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:37,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:37,196 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-11 11:13:37,200 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:37,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:37,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:37,206 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:37,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:37,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:37,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:37,206 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-11 11:13:37,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:37,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:37,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:37,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, 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 24 [2019-01-11 11:13:37,250 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 24 treesize of output 30 [2019-01-11 11:13:37,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,263 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 26 treesize of output 40 [2019-01-11 11:13:37,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,278 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 28 treesize of output 54 [2019-01-11 11:13:37,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:37,432 INFO L303 Elim1Store]: Index analysis took 133 ms [2019-01-11 11:13:37,433 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 32 treesize of output 71 [2019-01-11 11:13:37,434 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,630 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,731 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-11 11:13:37,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:13:37,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,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, 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-11 11:13:37,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,854 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-11 11:13:37,854 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,870 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,892 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:37,943 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:37,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,989 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-11 11:13:37,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,020 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-11 11:13:38,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:38,048 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-11 11:13:38,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:38,064 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-11 11:13:38,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:38,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:38,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:38,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:38,083 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-01-11 11:13:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:38,249 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-01-11 11:13:38,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:38,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:13:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:38,251 INFO L225 Difference]: With dead ends: 49 [2019-01-11 11:13:38,251 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 11:13:38,252 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-11 11:13:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 11:13:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-01-11 11:13:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 11:13:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-01-11 11:13:38,260 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-01-11 11:13:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:38,261 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-01-11 11:13:38,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-01-11 11:13:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:38,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:38,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:38,262 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-11 11:13:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:38,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:38,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:38,323 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-11 11:13:38,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:38,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:38,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:38,324 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-11 11:13:38,325 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:38,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:38,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:38,332 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:38,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:38,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:38,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:38,333 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-11 11:13:38,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:38,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:38,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:38,374 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 21 treesize of output 24 [2019-01-11 11:13:38,379 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 24 treesize of output 30 [2019-01-11 11:13:38,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,386 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 26 treesize of output 40 [2019-01-11 11:13:38,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,396 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 28 treesize of output 54 [2019-01-11 11:13:38,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,424 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:38,432 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 32 treesize of output 71 [2019-01-11 11:13:38,433 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,486 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,595 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-11 11:13:38,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,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-11 11:13:38,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,667 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-11 11:13:38,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,718 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-11 11:13:38,719 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,733 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,749 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,766 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,798 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-11 11:13:38,798 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:38,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,839 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-11 11:13:38,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:38,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:38,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,953 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-11 11:13:38,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,996 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-11 11:13:38,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:13:39,015 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-11 11:13:39,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:39,044 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-11 11:13:39,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:39,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:39,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:39,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:39,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:39,064 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-01-11 11:13:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:39,702 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-01-11 11:13:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:39,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:39,704 INFO L225 Difference]: With dead ends: 61 [2019-01-11 11:13:39,705 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 11:13:39,706 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-11 11:13:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 11:13:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-11 11:13:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:13:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-01-11 11:13:39,719 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-01-11 11:13:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:39,719 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-01-11 11:13:39,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-01-11 11:13:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:39,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:39,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:39,721 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-11 11:13:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:39,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:39,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:39,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:39,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:39,837 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-11 11:13:39,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:39,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:39,838 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:39,838 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-11 11:13:39,839 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:39,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:39,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:39,846 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:39,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:39,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:39,846 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-11 11:13:39,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:39,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:39,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:39,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,893 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 68 treesize of output 71 [2019-01-11 11:13:39,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,956 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 58 treesize of output 67 [2019-01-11 11:13:40,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,042 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 46 treesize of output 72 [2019-01-11 11:13:40,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,120 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:13:40,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:13:40,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,288 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:13:40,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:40,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:13:40,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:40,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:40,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:40,392 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,430 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,450 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,465 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,478 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,489 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,539 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-11 11:13:40,540 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:13:40,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:13:40,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,713 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-11 11:13:40,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:13:40,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,754 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:40,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:13:40,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:40,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 11:13:40,826 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-11 11:13:40,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:40,852 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-11 11:13:40,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:40,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:40,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:40,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:40,874 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-01-11 11:13:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:41,385 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-01-11 11:13:41,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:41,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:41,387 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:13:41,388 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:41,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-11 11:13:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:13:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-11 11:13:41,401 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-11 11:13:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:41,402 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-11 11:13:41,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-11 11:13:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:41,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:41,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:41,403 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-11 11:13:41,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:41,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:41,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:41,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:41,515 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-11 11:13:41,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:41,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:41,516 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:41,516 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-11 11:13:41,517 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:41,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:41,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:41,526 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:41,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:41,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:41,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:13:41,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:41,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:41,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:41,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, 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 24 [2019-01-11 11:13:41,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:41,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,582 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 26 treesize of output 40 [2019-01-11 11:13:41,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:41,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:41,661 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 32 treesize of output 71 [2019-01-11 11:13:41,662 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,793 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-11 11:13:41,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,836 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-11 11:13:41,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:13:41,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,926 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-11 11:13:41,927 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,944 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,961 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,977 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,012 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-11 11:13:42,012 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:42,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,049 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-11 11:13:42,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,080 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-11 11:13:42,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:42,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,113 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:42,115 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-11 11:13:42,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,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-11 11:13:42,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-11 11:13:42,169 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-11 11:13:42,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:42,195 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-11 11:13:42,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:42,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:42,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:42,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:42,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:42,216 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-11 11:13:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:42,639 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-11 11:13:42,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:42,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:42,641 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:13:42,641 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:42,642 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-11 11:13:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:42,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-11 11:13:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:13:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-11 11:13:42,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-11 11:13:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:42,651 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-11 11:13:42,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-11 11:13:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:42,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:42,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:42,653 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-11 11:13:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:42,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:42,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:42,754 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-11 11:13:42,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:42,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:42,755 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:42,755 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-11 11:13:42,756 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:42,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:42,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:42,760 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:42,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:42,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:42,761 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-11 11:13:42,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:42,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:42,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:42,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,802 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-11 11:13:42,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,837 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-11 11:13:42,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:13:42,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,934 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-11 11:13:42,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,036 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 21 treesize of output 24 [2019-01-11 11:13:43,039 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 24 treesize of output 30 [2019-01-11 11:13:43,043 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 26 treesize of output 40 [2019-01-11 11:13:43,050 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 28 treesize of output 54 [2019-01-11 11:13:43,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:43,065 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 32 treesize of output 71 [2019-01-11 11:13:43,067 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,466 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,638 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,656 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,671 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,685 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,725 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-11 11:13:43,725 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:43,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,773 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-11 11:13:43,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,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-11 11:13:43,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:43,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,837 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-11 11:13:43,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,873 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-11 11:13:43,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:13:43,892 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-11 11:13:43,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:43,917 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-11 11:13:43,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:43,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:43,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:43,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:43,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:43,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:43,938 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-11 11:13:44,118 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-11 11:13:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:44,535 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-11 11:13:44,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:44,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:44,537 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:13:44,537 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:13:44,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:13:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-11 11:13:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:13:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-11 11:13:44,547 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-11 11:13:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:44,548 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-11 11:13:44,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-11 11:13:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:44,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:44,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:44,549 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-11 11:13:44,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:44,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:44,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:44,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:44,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:44,659 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-11 11:13:44,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:44,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:44,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:44,660 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-11 11:13:44,661 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:44,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:44,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:44,666 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:44,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:44,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:44,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:44,666 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-11 11:13:44,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:44,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:44,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:44,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,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, 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-11 11:13:44,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,805 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-11 11:13:44,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,846 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-11 11:13:44,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,910 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-11 11:13:44,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,010 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 21 treesize of output 24 [2019-01-11 11:13:45,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:45,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:13:45,038 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 28 treesize of output 54 [2019-01-11 11:13:45,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:45,062 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 32 treesize of output 71 [2019-01-11 11:13:45,063 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,098 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,128 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,160 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:45,234 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:45,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:13:45,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:45,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:45,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,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, 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-11 11:13:45,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,406 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-11 11:13:45,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 11:13:45,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-11 11:13:45,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:45,433 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-11 11:13:45,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:45,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:45,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:45,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:45,454 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-11 11:13:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:45,799 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-01-11 11:13:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:45,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:45,802 INFO L225 Difference]: With dead ends: 73 [2019-01-11 11:13:45,802 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:13:45,802 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-11 11:13:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:13:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-01-11 11:13:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 11:13:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-01-11 11:13:45,819 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-01-11 11:13:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:45,820 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-01-11 11:13:45,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-01-11 11:13:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:45,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:45,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:45,821 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-11 11:13:45,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:45,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:45,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:45,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:45,903 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-11 11:13:45,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:45,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:45,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:45,904 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-11 11:13:45,905 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:45,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:45,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:45,912 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:45,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:45,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:45,913 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-11 11:13:45,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:45,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:45,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:45,953 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 21 treesize of output 24 [2019-01-11 11:13:45,956 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 24 treesize of output 30 [2019-01-11 11:13:45,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,970 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 26 treesize of output 40 [2019-01-11 11:13:45,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:45,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,994 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:46,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:13:46,013 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,070 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,145 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-11 11:13:46,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,178 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-11 11:13:46,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,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, 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-11 11:13:46,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,268 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-11 11:13:46,269 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,284 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,298 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,315 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:46,349 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:46,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,437 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-11 11:13:46,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,471 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-11 11:13:46,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:46,487 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-11 11:13:46,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:46,496 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-11 11:13:46,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:46,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:46,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:46,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:46,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:46,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:46,516 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-01-11 11:13:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:46,713 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-01-11 11:13:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:46,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:13:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:46,715 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:13:46,715 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:46,715 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-11 11:13:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-11 11:13:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 11:13:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-01-11 11:13:46,725 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-01-11 11:13:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:46,726 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-01-11 11:13:46,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-01-11 11:13:46,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:46,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:46,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:46,727 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:46,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:46,727 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-01-11 11:13:46,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:46,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:46,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:46,827 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-11 11:13:46,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:46,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:46,828 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:46,828 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-01-11 11:13:46,830 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:46,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:46,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:46,835 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:46,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:46,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:46,835 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-11 11:13:46,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:46,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:46,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:46,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,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 68 treesize of output 71 [2019-01-11 11:13:46,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,938 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 58 treesize of output 67 [2019-01-11 11:13:47,389 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-01-11 11:13:47,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,499 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-11 11:13:47,499 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 46 treesize of output 72 [2019-01-11 11:13:47,636 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-01-11 11:13:47,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,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, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:13:47,751 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-11 11:13:47,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:13:47,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,827 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:13:47,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:47,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:13:47,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:47,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:48,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:48,017 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,058 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,076 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,093 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,106 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,118 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,169 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-11 11:13:48,170 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:13:48,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:13:48,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:48,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:13:48,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:13:48,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:48,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-11 11:13:48,496 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-11 11:13:48,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:48,516 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-11 11:13:48,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:48,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:48,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:48,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:48,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:48,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:48,536 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-01-11 11:13:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:49,022 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-01-11 11:13:49,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:49,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:49,024 INFO L225 Difference]: With dead ends: 96 [2019-01-11 11:13:49,024 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 11:13:49,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 11:13:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-01-11 11:13:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 11:13:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-01-11 11:13:49,036 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-01-11 11:13:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:49,037 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-01-11 11:13:49,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-01-11 11:13:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:49,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:49,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:49,038 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-11 11:13:49,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:49,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:49,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:49,118 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-11 11:13:49,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:49,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:49,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:49,118 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-11 11:13:49,119 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:49,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:49,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:49,123 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:49,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:49,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:49,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:13:49,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:49,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:49,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:49,168 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 21 treesize of output 24 [2019-01-11 11:13:49,170 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 24 treesize of output 30 [2019-01-11 11:13:49,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,181 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 26 treesize of output 40 [2019-01-11 11:13:49,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,189 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 28 treesize of output 54 [2019-01-11 11:13:49,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,197 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:49,208 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 32 treesize of output 71 [2019-01-11 11:13:49,208 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,335 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-11 11:13:49,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,368 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-11 11:13:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,406 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-11 11:13:49,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,457 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-11 11:13:49,458 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,475 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,491 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,507 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,540 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-11 11:13:49,540 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:49,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,582 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-11 11:13:49,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,610 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-11 11:13:49,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:49,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:13:49,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,674 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-11 11:13:49,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 11:13:49,767 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-11 11:13:49,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:49,792 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-11 11:13:49,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:49,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:49,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:49,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:49,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:49,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:49,814 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-01-11 11:13:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:50,336 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-01-11 11:13:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:50,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:50,338 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:13:50,338 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 11:13:50,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 11:13:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-11 11:13:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 11:13:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-01-11 11:13:50,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-01-11 11:13:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:50,352 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-01-11 11:13:50,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-01-11 11:13:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:50,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:50,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:50,354 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-11 11:13:50,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:50,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:50,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:50,431 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-11 11:13:50,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:50,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:50,431 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:50,432 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-11 11:13:50,433 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:50,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:50,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:50,437 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:50,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:50,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:50,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:50,438 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-11 11:13:50,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:50,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:50,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:50,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:13:50,492 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 24 treesize of output 30 [2019-01-11 11:13:50,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,503 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 26 treesize of output 40 [2019-01-11 11:13:50,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,513 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 28 treesize of output 54 [2019-01-11 11:13:50,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:50,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:50,540 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,580 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,686 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 68 treesize of output 71 [2019-01-11 11:13:50,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,724 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 58 treesize of output 67 [2019-01-11 11:13:50,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,774 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 46 treesize of output 72 [2019-01-11 11:13:50,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,831 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:13:50,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:13:50,903 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,928 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,954 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,980 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,006 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,053 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-11 11:13:51,054 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:13:51,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:13:51,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,155 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-11 11:13:51,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:13:51,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,249 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:51,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:13:51,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:51,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 11:13:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:51,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:51,357 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-11 11:13:51,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:51,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:51,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:51,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:51,377 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-01-11 11:13:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:52,110 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-01-11 11:13:52,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:52,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:52,113 INFO L225 Difference]: With dead ends: 91 [2019-01-11 11:13:52,114 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:13:52,114 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-11 11:13:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:13:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-01-11 11:13:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 11:13:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-01-11 11:13:52,133 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-01-11 11:13:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:52,133 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-01-11 11:13:52,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-01-11 11:13:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:52,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:52,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:52,137 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-11 11:13:52,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:52,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:52,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:52,198 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-11 11:13:52,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:52,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:52,198 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:52,199 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-11 11:13:52,200 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:52,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:52,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:52,204 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:52,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:52,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:52,205 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-11 11:13:52,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:52,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:52,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:52,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:13:52,235 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 24 treesize of output 26 [2019-01-11 11:13:52,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,245 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 26 treesize of output 36 [2019-01-11 11:13:52,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,258 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 28 treesize of output 50 [2019-01-11 11:13:52,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:13:52,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:13:52,289 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,322 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,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, 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-11 11:13:52,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,464 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-11 11:13:52,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:13:52,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,547 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-11 11:13:52,548 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,563 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,578 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,595 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,626 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 1 xjuncts. [2019-01-11 11:13:52,627 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-01-11 11:13:52,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:13:52,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:13:52,775 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-11 11:13:52,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-01-11 11:13:53,002 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-01-11 11:13:53,004 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-11 11:13:53,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:53,008 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-11 11:13:53,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:13:53,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:13:53,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:53,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:53,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:53,028 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-01-11 11:13:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:53,139 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-01-11 11:13:53,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:13:53,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:13:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:53,141 INFO L225 Difference]: With dead ends: 90 [2019-01-11 11:13:53,141 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:13:53,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:13:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-01-11 11:13:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 11:13:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-01-11 11:13:53,160 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-01-11 11:13:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:53,160 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-01-11 11:13:53,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-01-11 11:13:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:53,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:53,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:53,161 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-11 11:13:53,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:53,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:53,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:53,258 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-11 11:13:53,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:53,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:53,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:53,259 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-11 11:13:53,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:53,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:53,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:53,265 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:53,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:53,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:53,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:53,266 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-11 11:13:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:53,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:53,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:53,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,310 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-11 11:13:53,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,348 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-11 11:13:53,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,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, 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-11 11:13:53,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,443 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-11 11:13:53,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,535 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 21 treesize of output 24 [2019-01-11 11:13:53,537 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 24 treesize of output 30 [2019-01-11 11:13:53,540 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 26 treesize of output 40 [2019-01-11 11:13:53,542 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 28 treesize of output 54 [2019-01-11 11:13:53,545 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:53,553 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 32 treesize of output 71 [2019-01-11 11:13:53,554 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,579 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,600 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,640 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,673 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-11 11:13:53,673 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:53,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,760 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-11 11:13:53,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:53,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:53,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,915 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-11 11:13:53,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,947 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-11 11:13:53,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:13:53,964 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-11 11:13:53,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:53,984 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-11 11:13:54,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:54,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:54,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:54,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:54,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:54,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:54,004 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-01-11 11:13:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:54,412 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-01-11 11:13:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:54,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:54,415 INFO L225 Difference]: With dead ends: 121 [2019-01-11 11:13:54,415 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 11:13:54,416 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-11 11:13:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 11:13:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-11 11:13:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:13:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-11 11:13:54,431 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-11 11:13:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:54,431 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-11 11:13:54,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-11 11:13:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:54,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:54,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:54,433 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:54,434 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-11 11:13:54,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:54,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:54,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:54,477 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-11 11:13:54,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:54,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:54,478 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:54,478 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-11 11:13:54,479 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:54,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:54,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:54,482 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:54,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:54,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:54,483 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-11 11:13:54,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:54,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:54,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:54,509 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 21 treesize of output 24 [2019-01-11 11:13:54,513 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 24 treesize of output 26 [2019-01-11 11:13:54,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,522 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 26 treesize of output 36 [2019-01-11 11:13:54,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:13:54,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,602 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:13:54,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:13:54,613 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,662 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,727 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-11 11:13:54,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,745 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-11 11:13:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,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, 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-11 11:13:54,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,828 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-11 11:13:54,829 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,842 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,873 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:54,904 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 11:13:54,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,932 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-11 11:13:54,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,959 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-11 11:13:54,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 11:13:54,974 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-11 11:13:54,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:55,008 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-11 11:13:55,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:55,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:55,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:55,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:55,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:55,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:55,028 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-01-11 11:13:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:55,308 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-01-11 11:13:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:55,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:13:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:55,310 INFO L225 Difference]: With dead ends: 110 [2019-01-11 11:13:55,311 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 11:13:55,311 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-11 11:13:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 11:13:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-01-11 11:13:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:13:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-11 11:13:55,323 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-11 11:13:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:55,323 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-11 11:13:55,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-11 11:13:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:55,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:55,324 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 11:13:55,324 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-01-11 11:13:55,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:55,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:55,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:55,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:55,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:55,532 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-01-11 11:13:55,551 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-11 11:13:55,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:55,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:55,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:55,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:55,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:55,552 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-11 11:13:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:55,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:55,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:13:55,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:55,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:55,660 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 21 treesize of output 24 [2019-01-11 11:13:55,662 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 24 treesize of output 30 [2019-01-11 11:13:55,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:13:55,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:55,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,696 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:55,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:55,707 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,748 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,914 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 68 treesize of output 71 [2019-01-11 11:13:55,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,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 58 treesize of output 67 [2019-01-11 11:13:55,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:13:56,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,057 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:13:56,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:13:56,130 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,156 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,182 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,205 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:56,278 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-11 11:13:56,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:13:56,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,361 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-11 11:13:56,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:13:56,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 103 [2019-01-11 11:13:56,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:56,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-01-11 11:13:56,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:13:56,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:56,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-11 11:13:56,758 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-11 11:13:56,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:57,224 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-11 11:13:57,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:57,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:13:57,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:57,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:57,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:57,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:57,283 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-01-11 11:13:58,248 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-11 11:13:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:58,973 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-01-11 11:13:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:58,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:58,975 INFO L225 Difference]: With dead ends: 133 [2019-01-11 11:13:58,975 INFO L226 Difference]: Without dead ends: 128 [2019-01-11 11:13:58,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-11 11:13:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-01-11 11:13:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 11:13:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-01-11 11:13:58,992 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-01-11 11:13:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:58,992 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-01-11 11:13:58,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-01-11 11:13:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:58,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:58,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:58,994 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:58,994 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-11 11:13:58,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:58,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:58,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:58,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:59,076 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-11 11:13:59,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:59,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:59,077 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:59,077 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-11 11:13:59,079 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:59,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:59,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:59,082 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:59,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:59,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:59,083 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-11 11:13:59,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:59,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:59,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:59,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:59,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:59,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,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 26 treesize of output 40 [2019-01-11 11:13:59,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:59,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,179 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:59,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:13:59,188 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,219 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:13:59,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,374 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-11 11:13:59,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:13:59,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,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-11 11:13:59,466 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,481 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,497 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,546 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-11 11:13:59,546 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:13:59,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,605 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-11 11:13:59,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,632 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-11 11:13:59,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:59,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,658 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-11 11:13:59,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,693 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-11 11:13:59,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:13:59,754 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-11 11:13:59,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:59,775 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-11 11:13:59,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:59,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:59,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:59,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:59,796 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-01-11 11:14:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:00,132 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-01-11 11:14:00,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:00,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:14:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:00,135 INFO L225 Difference]: With dead ends: 125 [2019-01-11 11:14:00,135 INFO L226 Difference]: Without dead ends: 124 [2019-01-11 11:14:00,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-11 11:14:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-11 11:14:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-01-11 11:14:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-11 11:14:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-01-11 11:14:00,155 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-01-11 11:14:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:00,155 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-01-11 11:14:00,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-01-11 11:14:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:00,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:00,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:00,156 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-01-11 11:14:00,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:00,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:00,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:00,307 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-01-11 11:14:00,401 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-11 11:14:00,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:00,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:00,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:00,402 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-11 11:14:00,403 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:00,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:00,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:00,407 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:00,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:00,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:00,407 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-11 11:14:00,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:00,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:00,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:00,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,454 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 68 treesize of output 71 [2019-01-11 11:14:00,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,510 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 58 treesize of output 67 [2019-01-11 11:14:00,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,567 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 46 treesize of output 72 [2019-01-11 11:14:00,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:00,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:00,711 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:14:00,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:00,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:00,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:00,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:00,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:00,890 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,923 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,944 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,960 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,973 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,028 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-11 11:14:01,029 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:01,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:14:01,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,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-11 11:14:01,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:01,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-11 11:14:01,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,195 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-11 11:14:01,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:14:01,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,233 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:01,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:14:01,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:01,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:14:01,309 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-11 11:14:01,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:01,358 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-11 11:14:01,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:01,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:01,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:01,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:01,379 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-01-11 11:14:01,524 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-11 11:14:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:03,106 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-01-11 11:14:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:03,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:03,109 INFO L225 Difference]: With dead ends: 149 [2019-01-11 11:14:03,109 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 11:14:03,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 11:14:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-01-11 11:14:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 11:14:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-01-11 11:14:03,131 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-01-11 11:14:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:03,131 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-01-11 11:14:03,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-01-11 11:14:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:03,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:03,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:03,133 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-11 11:14:03,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:03,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:03,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:03,303 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-11 11:14:03,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:03,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:03,303 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:03,303 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-11 11:14:03,304 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:03,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:03,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:03,308 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:03,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:03,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:03,308 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-11 11:14:03,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:03,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:03,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:03,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, 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 24 [2019-01-11 11:14:03,355 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 24 treesize of output 30 [2019-01-11 11:14:03,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,361 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 26 treesize of output 40 [2019-01-11 11:14:03,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,368 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 28 treesize of output 54 [2019-01-11 11:14:03,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:03,384 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 32 treesize of output 71 [2019-01-11 11:14:03,385 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,412 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,508 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-11 11:14:03,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,540 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-11 11:14:03,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,575 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-11 11:14:03,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,626 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-11 11:14:03,626 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,642 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,657 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,673 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,706 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-11 11:14:03,707 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:03,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:14:03,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,791 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-11 11:14:03,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:03,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:14:03,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,858 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-11 11:14:03,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:14:03,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,890 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:03,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,892 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-11 11:14:03,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,926 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-11 11:14:03,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 11:14:03,944 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-11 11:14:03,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:03,981 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-11 11:14:04,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:04,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:04,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:04,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:04,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:04,001 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-01-11 11:14:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:04,533 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-01-11 11:14:04,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:04,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:04,536 INFO L225 Difference]: With dead ends: 138 [2019-01-11 11:14:04,536 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 11:14:04,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 11:14:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-01-11 11:14:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-11 11:14:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-01-11 11:14:04,557 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-01-11 11:14:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:04,557 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-01-11 11:14:04,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-01-11 11:14:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:04,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:04,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:04,559 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:04,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-01-11 11:14:04,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:04,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:04,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:04,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:04,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:04,663 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-11 11:14:04,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:04,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:04,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:04,664 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-11 11:14:04,665 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:04,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:04,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:04,668 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:04,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:04,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:04,669 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-11 11:14:04,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:04,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:04,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:04,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:14:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:14:04,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,812 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 46 treesize of output 72 [2019-01-11 11:14:04,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,867 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:04,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:04,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:14:05,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:05,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:05,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:05,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:05,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:05,107 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,147 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,166 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,183 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,196 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,253 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-11 11:14:05,253 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:05,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:14:05,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,324 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-11 11:14:05,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:05,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,416 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:05,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:14:05,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:05,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 11:14:05,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:14:05,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:05,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 11:14:05,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-11 11:14:05,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:05,696 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-11 11:14:05,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:05,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:05,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:05,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:05,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:05,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:05,717 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-01-11 11:14:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:06,311 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-01-11 11:14:06,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:06,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:06,316 INFO L225 Difference]: With dead ends: 152 [2019-01-11 11:14:06,316 INFO L226 Difference]: Without dead ends: 151 [2019-01-11 11:14:06,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:14:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-11 11:14:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-01-11 11:14:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 11:14:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-01-11 11:14:06,336 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-01-11 11:14:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:06,337 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-01-11 11:14:06,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-01-11 11:14:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:06,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:06,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:06,338 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-11 11:14:06,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:06,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:06,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:06,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:06,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:06,546 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-11 11:14:06,586 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-11 11:14:06,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:06,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:06,587 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:06,587 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-11 11:14:06,587 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:06,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:06,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:06,591 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:06,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:06,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:06,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:06,591 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-11 11:14:06,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:06,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:06,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:06,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,713 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 68 treesize of output 71 [2019-01-11 11:14:06,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:14:06,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,797 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 46 treesize of output 72 [2019-01-11 11:14:06,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,876 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:06,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:06,950 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,010 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,073 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:14:07,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:07,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:07,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:07,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:07,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:07,172 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,207 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,228 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,244 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,270 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,316 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-11 11:14:07,316 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:07,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:14:07,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,391 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-11 11:14:07,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:07,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,426 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:07,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:14:07,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,474 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-11 11:14:07,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-11 11:14:07,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,507 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:07,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-01-11 11:14:07,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:07,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-11 11:14:09,116 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-11 11:14:09,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:09,154 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-11 11:14:09,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:09,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:09,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:09,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:09,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:09,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:09,175 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-01-11 11:14:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:09,919 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-01-11 11:14:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:09,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:09,922 INFO L225 Difference]: With dead ends: 141 [2019-01-11 11:14:09,922 INFO L226 Difference]: Without dead ends: 140 [2019-01-11 11:14:09,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-11 11:14:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-01-11 11:14:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 11:14:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-01-11 11:14:09,943 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-01-11 11:14:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:09,944 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-01-11 11:14:09,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-01-11 11:14:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:09,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:09,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:09,945 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-11 11:14:09,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:09,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:09,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:10,320 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-11 11:14:10,600 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-11 11:14:10,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:10,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:10,600 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:10,601 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-11 11:14:10,601 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:10,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:10,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:10,604 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:10,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:10,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:10,605 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-11 11:14:10,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:10,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:10,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:10,637 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 21 treesize of output 24 [2019-01-11 11:14:10,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:10,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,644 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 26 treesize of output 40 [2019-01-11 11:14:10,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,651 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 28 treesize of output 54 [2019-01-11 11:14:10,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:10,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:14:10,694 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,844 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-11 11:14:10,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,878 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-11 11:14:10,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,917 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-11 11:14:10,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,968 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-11 11:14:10,968 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,985 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,001 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,017 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,050 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-11 11:14:11,051 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:11,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,088 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-11 11:14:11,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,117 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-11 11:14:11,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:11,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:11,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:14:11,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,178 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-11 11:14:11,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-11 11:14:11,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,208 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 90 [2019-01-11 11:14:11,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,239 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-11 11:14:11,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 11:14:11,256 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-11 11:14:11,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:11,280 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-11 11:14:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:11,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:11,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:11,300 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-01-11 11:14:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:11,927 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-01-11 11:14:11,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:11,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:11,930 INFO L225 Difference]: With dead ends: 163 [2019-01-11 11:14:11,931 INFO L226 Difference]: Without dead ends: 162 [2019-01-11 11:14:11,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:14:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-11 11:14:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-01-11 11:14:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 11:14:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-01-11 11:14:11,954 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-01-11 11:14:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:11,954 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-01-11 11:14:11,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-01-11 11:14:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:11,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:11,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:11,955 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-01-11 11:14:11,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:11,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:11,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:11,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:12,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-11 11:14:12,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:12,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:12,027 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:12,027 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-01-11 11:14:12,028 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:12,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:12,030 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:12,030 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:12,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:12,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:12,031 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-11 11:14:12,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:12,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:12,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:12,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,071 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 68 treesize of output 71 [2019-01-11 11:14:12,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,111 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 58 treesize of output 67 [2019-01-11 11:14:12,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,161 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 46 treesize of output 72 [2019-01-11 11:14:12,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,217 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:12,353 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-11 11:14:12,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:12,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,392 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:14:12,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:12,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:12,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:12,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:12,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:12,523 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,558 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,578 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,594 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,608 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,620 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,666 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-11 11:14:12,666 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:12,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:14:12,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,761 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-11 11:14:12,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:12,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:14:12,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,843 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-11 11:14:12,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:14:12,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,879 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:12,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:14:12,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:12,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:14:12,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-11 11:14:12,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:12,998 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-11 11:14:13,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:13,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:13,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:13,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:13,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:13,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:13,019 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-01-11 11:14:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:13,705 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-01-11 11:14:13,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:13,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:13,707 INFO L225 Difference]: With dead ends: 163 [2019-01-11 11:14:13,708 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 11:14:13,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 11:14:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-01-11 11:14:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-11 11:14:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-01-11 11:14:13,729 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-01-11 11:14:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:13,729 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-01-11 11:14:13,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-01-11 11:14:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:13,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:13,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:13,730 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:13,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-11 11:14:13,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:13,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:13,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:13,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:13,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:13,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:13,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:13,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:13,863 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-11 11:14:13,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:13,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:13,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:13,866 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:13,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:13,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:13,868 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-11 11:14:13,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:13,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:13,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:13,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,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-11 11:14:13,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,940 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-11 11:14:13,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:14:14,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,029 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-11 11:14:14,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,103 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 21 treesize of output 24 [2019-01-11 11:14:14,106 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 24 treesize of output 30 [2019-01-11 11:14:14,108 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 26 treesize of output 40 [2019-01-11 11:14:14,112 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 28 treesize of output 54 [2019-01-11 11:14:14,117 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:14,122 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 32 treesize of output 71 [2019-01-11 11:14:14,123 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,148 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,169 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,185 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,198 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,243 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-11 11:14:14,243 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:14,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,322 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-11 11:14:14,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,378 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-11 11:14:14,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:14,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,410 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-11 11:14:14,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,447 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-11 11:14:14,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:14:14,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,516 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:14,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,518 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-11 11:14:14,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,551 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-11 11:14:14,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 11:14:14,571 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-11 11:14:14,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:14,608 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-11 11:14:14,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:14,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:14,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:14,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:14,627 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-01-11 11:14:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:15,162 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-01-11 11:14:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:15,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:15,165 INFO L225 Difference]: With dead ends: 165 [2019-01-11 11:14:15,165 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 11:14:15,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 11:14:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-01-11 11:14:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-11 11:14:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-01-11 11:14:15,189 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-01-11 11:14:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:15,189 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-01-11 11:14:15,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-01-11 11:14:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:15,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:15,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:15,190 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-11 11:14:15,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:15,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:15,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:15,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:15,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:15,228 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-11 11:14:15,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:15,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:15,229 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:15,229 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-11 11:14:15,229 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:15,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:15,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:15,231 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:15,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:15,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:15,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:15,232 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-11 11:14:15,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:15,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:15,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:15,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, 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 24 [2019-01-11 11:14:15,271 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 24 treesize of output 30 [2019-01-11 11:14:15,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:15,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,290 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 28 treesize of output 54 [2019-01-11 11:14:15,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,302 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:15,319 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 32 treesize of output 71 [2019-01-11 11:14:15,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,351 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,374 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:14:15,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:14:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,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, 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-11 11:14:15,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,570 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-11 11:14:15,571 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,585 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,615 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,675 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-11 11:14:15,675 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:16,132 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-11 11:14:16,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,137 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-11 11:14:16,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,167 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-11 11:14:16,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:16,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,191 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:16,192 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-11 11:14:16,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,223 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-11 11:14:16,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 11:14:16,240 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-11 11:14:16,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:16,258 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-11 11:14:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:16,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:14:16,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:16,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:14:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:14:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:14:16,278 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-01-11 11:14:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:16,577 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-01-11 11:14:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:16,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-11 11:14:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:16,580 INFO L225 Difference]: With dead ends: 158 [2019-01-11 11:14:16,580 INFO L226 Difference]: Without dead ends: 156 [2019-01-11 11:14:16,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-11 11:14:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-01-11 11:14:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-11 11:14:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-01-11 11:14:16,606 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-01-11 11:14:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:16,606 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-01-11 11:14:16,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:14:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-01-11 11:14:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:16,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:16,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:16,608 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:16,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:16,608 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-01-11 11:14:16,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:16,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:16,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:16,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:16,915 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-11 11:14:16,939 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-11 11:14:16,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:16,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:16,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:16,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:16,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:16,940 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-11 11:14:16,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:16,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:16,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:16,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:16,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:16,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,986 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 68 treesize of output 71 [2019-01-11 11:14:17,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:14:17,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,072 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 46 treesize of output 72 [2019-01-11 11:14:17,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:17,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:17,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,250 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:14:17,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:17,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:17,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:17,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:17,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:17,381 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,416 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,437 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,453 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,463 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,475 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,520 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-11 11:14:17,521 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:17,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:14:17,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,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-11 11:14:17,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:17,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:14:17,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,686 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-11 11:14:17,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 11:14:17,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,724 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:17,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:14:17,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:17,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:14:17,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-11 11:14:17,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:17,816 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-11 11:14:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:17,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 11:14:17,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:17,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:17,836 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-01-11 11:14:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:18,536 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-01-11 11:14:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:14:18,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:18,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:18,540 INFO L225 Difference]: With dead ends: 241 [2019-01-11 11:14:18,540 INFO L226 Difference]: Without dead ends: 235 [2019-01-11 11:14:18,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:14:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-11 11:14:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-01-11 11:14:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-11 11:14:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-01-11 11:14:18,576 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-01-11 11:14:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:18,577 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-01-11 11:14:18,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-01-11 11:14:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:18,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:18,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:18,578 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:18,579 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-11 11:14:18,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:18,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:18,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:18,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:18,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:18,933 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-11 11:14:18,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:18,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:18,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:18,934 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-11 11:14:18,935 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:18,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:18,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:18,937 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:18,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:18,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:18,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:18,938 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-11 11:14:18,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:18,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:18,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:18,978 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 21 treesize of output 24 [2019-01-11 11:14:18,982 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 24 treesize of output 30 [2019-01-11 11:14:18,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,988 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 26 treesize of output 40 [2019-01-11 11:14:18,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,994 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 28 treesize of output 54 [2019-01-11 11:14:18,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:19,014 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 32 treesize of output 71 [2019-01-11 11:14:19,015 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,043 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,065 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 11:14:19,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,201 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-11 11:14:19,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:14:19,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,291 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-11 11:14:19,292 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,313 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,326 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,342 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:19,375 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-11 11:14:19,375 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:19,607 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 11:14:19,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:19,755 INFO L303 Elim1Store]: Index analysis took 144 ms [2019-01-11 11:14:19,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:14:19,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:19,873 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-11 11:14:19,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-01-11 11:14:20,080 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-11 11:14:20,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,089 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:20,090 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 60 treesize of output 72 [2019-01-11 11:14:20,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-11 11:14:20,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-11 11:14:20,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 11:14:20,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-01-11 11:14:21,154 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-01-11 11:14:21,157 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-11 11:14:21,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:21,185 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-11 11:14:21,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:21,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:21,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:21,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:21,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:21,205 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-01-11 11:14:21,691 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-11 11:14:22,200 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-11 11:14:22,581 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-01-11 11:14:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:22,895 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-01-11 11:14:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:22,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:14:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:22,898 INFO L225 Difference]: With dead ends: 208 [2019-01-11 11:14:22,898 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 11:14:22,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 11:14:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-01-11 11:14:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-11 11:14:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-01-11 11:14:22,927 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-01-11 11:14:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:22,927 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-01-11 11:14:22,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-01-11 11:14:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:22,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:22,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:22,929 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:22,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:22,929 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-01-11 11:14:22,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:22,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:22,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:22,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:22,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:23,062 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-11 11:14:23,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:23,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:23,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:23,063 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-11 11:14:23,064 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:23,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:23,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:23,067 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:23,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:23,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:23,068 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-11 11:14:23,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:23,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:23,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:23,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,107 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-11 11:14:23,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,141 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-11 11:14:23,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,182 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-11 11:14:23,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,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, 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-11 11:14:23,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,287 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:14:23,330 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 24 treesize of output 30 [2019-01-11 11:14:23,334 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 26 treesize of output 40 [2019-01-11 11:14:23,337 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 28 treesize of output 54 [2019-01-11 11:14:23,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:23,349 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 32 treesize of output 71 [2019-01-11 11:14:23,350 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,377 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,397 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,413 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,426 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,470 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-11 11:14:23,470 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:23,699 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 11:14:23,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:14:23,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:23,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-11 11:14:23,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-11 11:14:24,054 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-11 11:14:24,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 103 [2019-01-11 11:14:24,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:24,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,260 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 63 treesize of output 89 [2019-01-11 11:14:24,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:24,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 11:14:24,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-01-11 11:14:24,579 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-11 11:14:24,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,653 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:24,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 118 [2019-01-11 11:14:24,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:14:24,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:24,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,992 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 88 [2019-01-11 11:14:24,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:25,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,160 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 50 treesize of output 110 [2019-01-11 11:14:25,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:25,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 11:14:25,318 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-01-11 11:14:25,442 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-11 11:14:25,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:25,477 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-11 11:14:25,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:25,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:25,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:25,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:25,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:25,497 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-01-11 11:14:26,396 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-11 11:14:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:26,930 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-01-11 11:14:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:14:26,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:26,935 INFO L225 Difference]: With dead ends: 280 [2019-01-11 11:14:26,936 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 11:14:26,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:14:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 11:14:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-01-11 11:14:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 11:14:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-01-11 11:14:26,977 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-01-11 11:14:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:26,977 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-01-11 11:14:26,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-01-11 11:14:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:26,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:26,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:26,978 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:26,979 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-11 11:14:26,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:26,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:26,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:27,074 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-11 11:14:27,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:14:27,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:14:27,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:14:27,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:14:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:14:27,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:14:27,075 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-01-11 11:14:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:27,183 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-01-11 11:14:27,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:14:27,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:14:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:27,187 INFO L225 Difference]: With dead ends: 201 [2019-01-11 11:14:27,187 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 11:14:27,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:14:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 11:14:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-11 11:14:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 11:14:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-01-11 11:14:27,230 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-01-11 11:14:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:27,230 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-01-11 11:14:27,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:14:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-01-11 11:14:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:27,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:27,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:27,232 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-11 11:14:27,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:27,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:27,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:27,316 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-11 11:14:27,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:27,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:27,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:27,316 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-11 11:14:27,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:27,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:27,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:27,319 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:27,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:27,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:27,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:27,320 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-11 11:14:27,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:27,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:27,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:27,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,363 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-11 11:14:27,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,394 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-11 11:14:27,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,434 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-11 11:14:27,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,488 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-11 11:14:27,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,580 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 21 treesize of output 24 [2019-01-11 11:14:27,583 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 24 treesize of output 30 [2019-01-11 11:14:27,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:27,590 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 28 treesize of output 54 [2019-01-11 11:14:27,593 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:27,598 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 32 treesize of output 71 [2019-01-11 11:14:27,599 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,624 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,645 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,661 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,674 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,686 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,719 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-11 11:14:27,719 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:27,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,759 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-11 11:14:27,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,789 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-11 11:14:27,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:27,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,816 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:27,816 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-11 11:14:27,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,849 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-11 11:14:27,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 11:14:27,867 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-11 11:14:27,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:27,885 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-11 11:14:27,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:27,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:27,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:27,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:27,905 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-01-11 11:14:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:28,236 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-01-11 11:14:28,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:28,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:14:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:28,239 INFO L225 Difference]: With dead ends: 208 [2019-01-11 11:14:28,239 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 11:14:28,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-11 11:14:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 11:14:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-01-11 11:14:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-11 11:14:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-01-11 11:14:28,271 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-01-11 11:14:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:28,271 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-01-11 11:14:28,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-01-11 11:14:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:28,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:28,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:28,273 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-11 11:14:28,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:28,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:28,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:28,367 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-11 11:14:28,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:28,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:28,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:28,368 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-11 11:14:28,368 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:28,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:28,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:28,370 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:28,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:28,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:28,371 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-11 11:14:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:28,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:28,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:28,389 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-11 11:14:28,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:14:28,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:14:28,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,511 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-11 11:14:28,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,600 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 21 treesize of output 24 [2019-01-11 11:14:28,604 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 24 treesize of output 26 [2019-01-11 11:14:28,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:14:28,613 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 28 treesize of output 50 [2019-01-11 11:14:28,618 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:14:28,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:14:28,648 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,672 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,705 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,717 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,729 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,759 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-11 11:14:28,759 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:14:28,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,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, 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-11 11:14:28,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,828 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-11 11:14:28,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:14:28,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,857 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-11 11:14:28,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,885 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-11 11:14:28,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-11 11:14:28,905 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-11 11:14:28,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:28,928 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-11 11:14:28,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:28,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:28,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:28,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:28,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:28,948 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-01-11 11:14:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:29,246 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-01-11 11:14:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:29,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:14:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:29,249 INFO L225 Difference]: With dead ends: 210 [2019-01-11 11:14:29,249 INFO L226 Difference]: Without dead ends: 208 [2019-01-11 11:14:29,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-11 11:14:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-11 11:14:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-01-11 11:14:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-11 11:14:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-01-11 11:14:29,299 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-01-11 11:14:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:29,299 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-01-11 11:14:29,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-01-11 11:14:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:29,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:29,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:29,300 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-01-11 11:14:29,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:29,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:29,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:29,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:29,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:29,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-11 11:14:29,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:29,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:29,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:29,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:29,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:29,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 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-11 11:14:29,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:29,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:29,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:29,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:29,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:29,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:14:29,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,523 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 58 treesize of output 67 [2019-01-11 11:14:29,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:14:29,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,663 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:29,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:29,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:14:29,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:29,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:29,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:29,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:29,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:29,927 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,278 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,298 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,314 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,326 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,338 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,382 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-11 11:14:30,382 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:30,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:14:30,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,461 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-11 11:14:30,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:30,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:14:30,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,546 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-11 11:14:30,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 11:14:30,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,592 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:30,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-11 11:14:30,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:30,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:14:30,667 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-11 11:14:30,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:30,708 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-11 11:14:30,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:30,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:30,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:30,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:30,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:30,728 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-01-11 11:14:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:32,370 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-01-11 11:14:32,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:32,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:32,374 INFO L225 Difference]: With dead ends: 242 [2019-01-11 11:14:32,374 INFO L226 Difference]: Without dead ends: 240 [2019-01-11 11:14:32,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 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-11 11:14:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-11 11:14:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-01-11 11:14:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-11 11:14:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-01-11 11:14:32,410 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-01-11 11:14:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:32,410 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-01-11 11:14:32,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-01-11 11:14:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:32,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:32,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:32,411 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-11 11:14:32,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:32,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:32,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:32,548 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-11 11:14:32,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:32,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:32,549 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:32,549 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-11 11:14:32,551 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:32,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:32,553 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:32,554 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:32,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:32,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:32,554 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-11 11:14:32,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:32,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:32,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:32,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 21 treesize of output 24 [2019-01-11 11:14:32,593 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 24 treesize of output 30 [2019-01-11 11:14:32,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,601 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 26 treesize of output 40 [2019-01-11 11:14:32,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,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 28 treesize of output 54 [2019-01-11 11:14:32,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:32,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:32,625 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,667 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,690 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,768 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 68 treesize of output 71 [2019-01-11 11:14:32,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:14:32,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,853 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 46 treesize of output 72 [2019-01-11 11:14:32,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,911 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:32,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:32,992 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,019 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,075 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,101 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,127 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,173 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-11 11:14:33,174 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:33,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:14:33,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,254 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-11 11:14:33,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:33,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:14:33,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,335 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-11 11:14:33,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 11:14:33,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,377 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:33,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-11 11:14:33,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:33,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:14:33,455 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-11 11:14:33,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:33,495 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-11 11:14:33,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:33,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:33,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:33,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:33,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:33,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:33,515 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-01-11 11:14:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:34,107 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-01-11 11:14:34,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:34,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:34,111 INFO L225 Difference]: With dead ends: 249 [2019-01-11 11:14:34,111 INFO L226 Difference]: Without dead ends: 247 [2019-01-11 11:14:34,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-11 11:14:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-01-11 11:14:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-11 11:14:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-01-11 11:14:34,145 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-01-11 11:14:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:34,146 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-01-11 11:14:34,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-01-11 11:14:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:34,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:34,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:34,147 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:34,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:34,147 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-11 11:14:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:34,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:34,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:34,225 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-11 11:14:34,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:34,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:34,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:34,225 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-11 11:14:34,226 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:34,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:34,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:34,229 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:34,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:34,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:34,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:14:34,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:34,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:34,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:34,282 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 21 treesize of output 24 [2019-01-11 11:14:34,287 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 24 treesize of output 30 [2019-01-11 11:14:34,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,298 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 28 treesize of output 54 [2019-01-11 11:14:34,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:34,313 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 32 treesize of output 71 [2019-01-11 11:14:34,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,344 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,367 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,443 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-11 11:14:34,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,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 41 treesize of output 53 [2019-01-11 11:14:34,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,518 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-11 11:14:34,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,569 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-11 11:14:34,569 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,586 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,602 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,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-11 11:14:34,651 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:34,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,711 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-11 11:14:34,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,740 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-11 11:14:34,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:34,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,772 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-11 11:14:34,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,807 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-11 11:14:34,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 11:14:34,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,842 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:34,842 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-11 11:14:34,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,894 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-11 11:14:34,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:14:34,914 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-11 11:14:34,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:34,951 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-11 11:14:34,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:34,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:34,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:34,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:34,972 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-01-11 11:14:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:35,530 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-01-11 11:14:35,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:35,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:35,534 INFO L225 Difference]: With dead ends: 260 [2019-01-11 11:14:35,534 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 11:14:35,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:14:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 11:14:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-01-11 11:14:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:14:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-11 11:14:35,577 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-11 11:14:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:35,578 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-11 11:14:35,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-11 11:14:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:35,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:35,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:35,579 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:35,579 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-11 11:14:35,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:35,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:35,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:35,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:35,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:35,695 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-11 11:14:35,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:35,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:35,695 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:35,695 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-11 11:14:35,696 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:35,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:35,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:35,699 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:35,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:35,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:35,700 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-11 11:14:35,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:35,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:35,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:35,736 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 21 treesize of output 24 [2019-01-11 11:14:35,760 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 24 treesize of output 26 [2019-01-11 11:14:35,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,771 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 26 treesize of output 36 [2019-01-11 11:14:35,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:14:35,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:14:35,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:14:35,801 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,862 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,953 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 63 treesize of output 56 [2019-01-11 11:14:35,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,973 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 53 treesize of output 63 [2019-01-11 11:14:36,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:14:36,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:14:36,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:14:36,147 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,175 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,205 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,232 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,264 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,309 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-11 11:14:36,310 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:14:36,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:14:36,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,393 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-11 11:14:36,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:14:36,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,432 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:36,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 101 [2019-01-11 11:14:36,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:36,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-01-11 11:14:36,560 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-11 11:14:36,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:36,582 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-11 11:14:36,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:36,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:36,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:36,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:36,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:36,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:36,602 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-11 11:14:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:36,907 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-01-11 11:14:36,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:36,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:14:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:36,910 INFO L225 Difference]: With dead ends: 244 [2019-01-11 11:14:36,910 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 11:14:36,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:36,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 11:14:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-01-11 11:14:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:14:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-11 11:14:36,948 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-11 11:14:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:36,948 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-11 11:14:36,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-11 11:14:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:36,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:36,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:36,950 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:36,950 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-11 11:14:36,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:36,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:36,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:36,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:36,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:37,109 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-11 11:14:37,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:37,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:37,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:37,109 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-11 11:14:37,111 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:37,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:37,113 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:37,113 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:37,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:37,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:37,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:37,113 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-11 11:14:37,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:37,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:37,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:37,133 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 21 treesize of output 24 [2019-01-11 11:14:37,137 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 24 treesize of output 26 [2019-01-11 11:14:37,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,145 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 26 treesize of output 36 [2019-01-11 11:14:37,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:14:37,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:14:37,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:14:37,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,205 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,292 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-11 11:14:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,309 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-11 11:14:37,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,344 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-11 11:14:37,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,391 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-11 11:14:37,391 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,405 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,420 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,436 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,466 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-11 11:14:37,466 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:14:37,654 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-11 11:14:37,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:37,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:14:37,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-11 11:14:38,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-11 11:14:38,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:349 [2019-01-11 11:14:38,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,180 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 63 [2019-01-11 11:14:38,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,272 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 58 treesize of output 92 [2019-01-11 11:14:38,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,358 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:38,359 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 58 treesize of output 72 [2019-01-11 11:14:38,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 11:14:38,422 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:162, output treesize:126 [2019-01-11 11:14:38,510 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-11 11:14:38,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:38,548 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-11 11:14:38,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:38,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:38,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:38,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:38,568 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-11 11:14:38,986 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-11 11:14:39,353 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-01-11 11:14:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:52,008 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-01-11 11:14:52,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:52,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:14:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:52,012 INFO L225 Difference]: With dead ends: 273 [2019-01-11 11:14:52,012 INFO L226 Difference]: Without dead ends: 272 [2019-01-11 11:14:52,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=79, Invalid=130, Unknown=1, NotChecked=0, Total=210 [2019-01-11 11:14:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-11 11:14:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-01-11 11:14:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-11 11:14:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-01-11 11:14:52,049 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-01-11 11:14:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:52,049 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-01-11 11:14:52,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-01-11 11:14:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:52,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:52,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:52,050 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:52,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-01-11 11:14:52,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:52,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:52,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:52,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:52,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:52,331 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-01-11 11:14:52,444 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-11 11:14:52,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:52,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:52,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:52,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:52,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:52,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:14:52,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:52,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:52,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:52,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:52,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:52,481 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 21 treesize of output 24 [2019-01-11 11:14:52,484 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 24 treesize of output 30 [2019-01-11 11:14:52,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,490 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 26 treesize of output 40 [2019-01-11 11:14:52,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:52,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,504 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:52,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:52,514 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,554 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,661 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 68 treesize of output 71 [2019-01-11 11:14:52,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:14:52,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,747 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 46 treesize of output 72 [2019-01-11 11:14:52,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:52,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:52,878 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,903 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,929 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,956 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,982 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,028 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-11 11:14:53,028 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:53,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:14:53,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,115 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-11 11:14:53,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:53,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,145 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:53,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:14:53,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:53,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 11:14:53,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:14:53,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:53,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 11:14:53,302 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-11 11:14:53,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:53,325 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-11 11:14:53,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:53,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:53,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:53,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:53,344 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-01-11 11:14:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:54,070 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-01-11 11:14:54,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:54,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:54,074 INFO L225 Difference]: With dead ends: 274 [2019-01-11 11:14:54,074 INFO L226 Difference]: Without dead ends: 273 [2019-01-11 11:14:54,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-11 11:14:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-01-11 11:14:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 11:14:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-11 11:14:54,116 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-11 11:14:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:54,116 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-11 11:14:54,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-11 11:14:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:54,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:54,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:54,118 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-01-11 11:14:54,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:54,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:54,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:54,295 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-11 11:14:54,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:54,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:54,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:54,295 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-01-11 11:14:54,296 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:54,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:54,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:54,298 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:14:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:54,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:54,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:54,299 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-11 11:14:54,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:54,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:54,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:54,321 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 63 treesize of output 56 [2019-01-11 11:14:54,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,355 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 53 treesize of output 63 [2019-01-11 11:14:54,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:14:54,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:14:54,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:14:54,520 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,656 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 21 treesize of output 24 [2019-01-11 11:14:54,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, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:14:54,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:14:54,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:14:54,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:14:54,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:14:54,676 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,708 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,728 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,742 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,754 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,766 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:54,810 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-11 11:14:54,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:14:54,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:54,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-01-11 11:14:54,892 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-11 11:14:54,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:54,902 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-11 11:14:54,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:54,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:14:54,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:54,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:14:54,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:14:54,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:14:54,921 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-01-11 11:14:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:55,129 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-01-11 11:14:55,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:14:55,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-11 11:14:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:55,133 INFO L225 Difference]: With dead ends: 242 [2019-01-11 11:14:55,133 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 11:14:55,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:14:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 11:14:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-11 11:14:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 11:14:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-11 11:14:55,170 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-11 11:14:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:55,170 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-11 11:14:55,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:14:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-11 11:14:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:55,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:55,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:55,171 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-01-11 11:14:55,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:55,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:55,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:55,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:55,324 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-11 11:14:55,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:55,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:55,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:55,325 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-11 11:14:55,326 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:55,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:55,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:55,329 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:55,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:55,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:55,330 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-11 11:14:55,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:55,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:55,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:55,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,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 68 treesize of output 71 [2019-01-11 11:14:55,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,406 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 58 treesize of output 67 [2019-01-11 11:14:55,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,452 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 46 treesize of output 72 [2019-01-11 11:14:55,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,508 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:14:55,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:14:55,591 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:14:55,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:55,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:55,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:55,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:55,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:55,747 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,781 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,802 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,831 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,843 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,889 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-11 11:14:55,889 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:14:55,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:14:55,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:55,968 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-11 11:14:55,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:14:55,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:14:56,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,053 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-11 11:14:56,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:14:56,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:56,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 128 [2019-01-11 11:14:56,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:56,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:14:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:56,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:56,204 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-11 11:14:56,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:56,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:56,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:56,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:56,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:56,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:56,223 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-01-11 11:14:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:56,927 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-01-11 11:14:56,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:56,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:14:56,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:56,930 INFO L225 Difference]: With dead ends: 276 [2019-01-11 11:14:56,930 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 11:14:56,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 11:14:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-01-11 11:14:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-11 11:14:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-01-11 11:14:56,976 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-01-11 11:14:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:56,977 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-01-11 11:14:56,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-01-11 11:14:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:56,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:56,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:56,978 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:56,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:56,978 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-11 11:14:56,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:56,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:56,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:56,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:57,130 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-11 11:14:57,140 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-11 11:14:57,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:57,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:57,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:57,141 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-11 11:14:57,142 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:57,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:57,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:57,145 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:57,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:57,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:57,145 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-11 11:14:57,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:57,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:57,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:57,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,189 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-11 11:14:57,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,227 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-11 11:14:57,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:14:57,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,319 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-11 11:14:57,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,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, 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 24 [2019-01-11 11:14:57,399 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 24 treesize of output 30 [2019-01-11 11:14:57,402 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 26 treesize of output 40 [2019-01-11 11:14:57,405 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 28 treesize of output 54 [2019-01-11 11:14:57,409 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:57,417 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 32 treesize of output 71 [2019-01-11 11:14:57,418 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,445 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,466 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,482 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,495 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:57,540 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:14:57,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,617 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-11 11:14:57,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,976 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-11 11:14:57,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:57,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,004 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-11 11:14:58,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,038 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-11 11:14:58,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:14:58,055 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-11 11:14:58,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:58,074 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-11 11:14:58,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:58,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:58,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:58,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:58,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:58,094 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-01-11 11:14:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:58,489 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-01-11 11:14:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:58,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:14:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:58,494 INFO L225 Difference]: With dead ends: 288 [2019-01-11 11:14:58,494 INFO L226 Difference]: Without dead ends: 287 [2019-01-11 11:14:58,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-11 11:14:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-01-11 11:14:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-11 11:14:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-01-11 11:14:58,547 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-01-11 11:14:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:58,547 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-01-11 11:14:58,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-01-11 11:14:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:14:58,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:58,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:14:58,548 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-01-11 11:14:58,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:58,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:58,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:58,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:58,613 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-11 11:14:58,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:58,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:58,614 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:14:58,614 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-01-11 11:14:58,615 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:58,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:58,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:58,618 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:58,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:58,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:58,619 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-11 11:14:58,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:58,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:58,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:58,638 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 21 treesize of output 24 [2019-01-11 11:14:58,644 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 24 treesize of output 26 [2019-01-11 11:14:58,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,660 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 26 treesize of output 36 [2019-01-11 11:14:58,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,667 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 28 treesize of output 50 [2019-01-11 11:14:58,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,676 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:14:58,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:14:58,687 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,798 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-11 11:14:58,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,815 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-11 11:14:58,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:14:58,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,897 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-11 11:14:58,897 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,911 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,925 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,941 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:58,972 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 11:14:59,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:14:59,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:59,106 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-11 11:14:59,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 11:14:59,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,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 33 treesize of output 67 [2019-01-11 11:14:59,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:59,168 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-11 11:14:59,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-01-11 11:14:59,183 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-11 11:14:59,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:59,196 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-11 11:14:59,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:14:59,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:59,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:14:59,215 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-01-11 11:14:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:59,603 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-01-11 11:14:59,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:59,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:14:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:59,608 INFO L225 Difference]: With dead ends: 319 [2019-01-11 11:14:59,608 INFO L226 Difference]: Without dead ends: 318 [2019-01-11 11:14:59,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-11 11:14:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-01-11 11:14:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 11:14:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-11 11:14:59,671 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-01-11 11:14:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:59,671 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-11 11:14:59,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-11 11:14:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:59,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:59,673 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:14:59,673 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-01-11 11:14:59,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:59,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:59,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:59,704 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-11 11:14:59,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:59,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:59,705 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:59,705 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-01-11 11:14:59,706 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:59,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:59,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:59,708 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:14:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:59,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:59,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:59,708 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-11 11:14:59,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:59,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:59,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:59,731 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-11 11:14:59,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,760 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-11 11:14:59,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,800 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-11 11:14:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,853 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-11 11:14:59,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:59,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:59,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:59,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:59,940 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 21 treesize of output 24 [2019-01-11 11:14:59,945 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 24 treesize of output 26 [2019-01-11 11:14:59,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:14:59,953 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 28 treesize of output 50 [2019-01-11 11:14:59,957 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:14:59,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:14:59,967 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:59,992 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,011 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,026 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,038 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,050 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:00,081 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 11:15:00,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,140 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-11 11:15:00,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,165 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-11 11:15:00,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:15:00,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,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, 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-11 11:15:00,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,223 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-11 11:15:00,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-11 11:15:00,243 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-11 11:15:00,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:00,261 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-11 11:15:00,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:00,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:15:00,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:00,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:15:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:15:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:15:00,281 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-01-11 11:15:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:00,505 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-01-11 11:15:00,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:00,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-11 11:15:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:00,509 INFO L225 Difference]: With dead ends: 290 [2019-01-11 11:15:00,510 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 11:15:00,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 11:15:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-01-11 11:15:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 11:15:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-11 11:15:00,575 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-01-11 11:15:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:00,575 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-11 11:15:00,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:15:00,575 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-11 11:15:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:00,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:00,576 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-11 11:15:00,577 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-01-11 11:15:00,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:00,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:00,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:00,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:00,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:00,756 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-11 11:15:00,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:00,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:00,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:00,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:00,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:00,757 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-11 11:15:00,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:15:00,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:15:00,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:15:00,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:00,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:00,789 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 21 treesize of output 24 [2019-01-11 11:15:00,791 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 24 treesize of output 30 [2019-01-11 11:15:00,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,798 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 26 treesize of output 40 [2019-01-11 11:15:00,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,807 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 28 treesize of output 54 [2019-01-11 11:15:00,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,816 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:00,831 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 32 treesize of output 71 [2019-01-11 11:15:00,832 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,861 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,884 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,917 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,958 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-11 11:15:00,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,999 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-11 11:15:01,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,037 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-11 11:15:01,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,087 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-11 11:15:01,087 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,104 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,120 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:01,170 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:15:01,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,204 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-11 11:15:01,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,232 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-11 11:15:01,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:15:01,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,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 88 [2019-01-11 11:15:01,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,296 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-11 11:15:01,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:15:01,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,327 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 38 treesize of output 98 [2019-01-11 11:15:01,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:01,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 11:15:01,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,403 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 38 treesize of output 98 [2019-01-11 11:15:01,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,443 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-11 11:15:01,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:15:01,460 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-11 11:15:01,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:01,494 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-11 11:15:01,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:01,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:15:01,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:01,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:15:01,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:15:01,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:15:01,513 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-01-11 11:15:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:02,194 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-01-11 11:15:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:15:02,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:15:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:02,199 INFO L225 Difference]: With dead ends: 423 [2019-01-11 11:15:02,199 INFO L226 Difference]: Without dead ends: 421 [2019-01-11 11:15:02,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-11 11:15:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-01-11 11:15:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-11 11:15:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-01-11 11:15:02,334 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-01-11 11:15:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:02,335 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-01-11 11:15:02,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:15:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-01-11 11:15:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:02,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:02,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:02,337 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:02,338 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-01-11 11:15:02,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:02,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:02,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:02,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:02,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:02,489 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:15:02,660 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-11 11:15:02,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:02,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:02,661 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:02,661 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-01-11 11:15:02,662 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:02,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:02,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:02,666 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:02,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:02,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:02,666 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-11 11:15:02,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:02,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:02,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:02,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, 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 24 [2019-01-11 11:15:02,711 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 24 treesize of output 30 [2019-01-11 11:15:02,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,715 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 26 treesize of output 40 [2019-01-11 11:15:02,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,721 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 28 treesize of output 54 [2019-01-11 11:15:02,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:02,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:02,739 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,779 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,916 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 68 treesize of output 71 [2019-01-11 11:15:02,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,958 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 58 treesize of output 67 [2019-01-11 11:15:02,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:15:03,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,072 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:15:03,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:15:03,143 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,170 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,193 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,220 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,246 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,293 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-11 11:15:03,293 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:15:03,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:15:03,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,370 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-11 11:15:03,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:15:03,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:15:03,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,459 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-11 11:15:03,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:15:03,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,503 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:03,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 11:15:03,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:03,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-11 11:15:03,578 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-11 11:15:03,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:03,716 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-11 11:15:03,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:03,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:03,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:03,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:03,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:03,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:03,735 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-01-11 11:15:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:04,380 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-01-11 11:15:04,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:04,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:04,386 INFO L225 Difference]: With dead ends: 368 [2019-01-11 11:15:04,386 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 11:15:04,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 11:15:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-01-11 11:15:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 11:15:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-01-11 11:15:04,453 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-01-11 11:15:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:04,453 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-01-11 11:15:04,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-01-11 11:15:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:04,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:04,454 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:15:04,454 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-01-11 11:15:04,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:04,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:04,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:04,506 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-11 11:15:04,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:04,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:04,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:04,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:04,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:04,507 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-11 11:15:04,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:15:04,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:15:04,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:15:04,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:04,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:04,549 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 21 treesize of output 24 [2019-01-11 11:15:04,552 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 24 treesize of output 30 [2019-01-11 11:15:04,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:15:04,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:04,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:04,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:04,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,694 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,717 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,792 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 68 treesize of output 71 [2019-01-11 11:15:04,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,833 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 58 treesize of output 67 [2019-01-11 11:15:04,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,879 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 46 treesize of output 72 [2019-01-11 11:15:04,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,935 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:15:04,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:15:05,005 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,031 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,057 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,083 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,110 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,156 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-11 11:15:05,156 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:15:05,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:15:05,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,224 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-11 11:15:05,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:15:05,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:15:05,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,303 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-11 11:15:05,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:15:05,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:05,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:15:05,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,398 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-11 11:15:05,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:15:05,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:05,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 135 [2019-01-11 11:15:05,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:05,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:05,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-01-11 11:15:05,522 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-11 11:15:05,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:05,563 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-11 11:15:05,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:05,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:15:05,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:05,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:15:05,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:15:05,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:05,582 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-01-11 11:15:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:06,369 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-01-11 11:15:06,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:06,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:15:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:06,374 INFO L225 Difference]: With dead ends: 407 [2019-01-11 11:15:06,374 INFO L226 Difference]: Without dead ends: 401 [2019-01-11 11:15:06,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:15:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-01-11 11:15:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-01-11 11:15:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 11:15:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-01-11 11:15:06,452 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-01-11 11:15:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:06,452 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-01-11 11:15:06,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:15:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-01-11 11:15:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:06,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:06,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:06,454 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-01-11 11:15:06,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:06,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:06,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:06,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:06,591 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-11 11:15:06,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:06,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:06,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:06,591 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-01-11 11:15:06,592 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:06,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:06,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:06,594 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:15:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:06,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:06,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:06,595 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-11 11:15:06,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:06,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:06,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:06,641 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 21 treesize of output 24 [2019-01-11 11:15:06,646 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 24 treesize of output 30 [2019-01-11 11:15:06,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,650 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 26 treesize of output 40 [2019-01-11 11:15:06,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,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 28 treesize of output 54 [2019-01-11 11:15:06,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,689 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:06,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:06,698 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:15:06,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,887 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 58 treesize of output 67 [2019-01-11 11:15:06,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:15:06,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,989 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:15:07,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:15:07,064 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,090 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,116 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,142 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,168 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,214 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-11 11:15:07,215 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:15:07,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:15:07,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,293 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-11 11:15:07,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:15:07,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:15:07,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,383 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-11 11:15:07,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 11:15:07,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,426 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:07,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:15:07,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,482 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-11 11:15:07,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:15:07,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,520 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:07,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-11 11:15:07,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:07,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 11:15:07,598 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-11 11:15:07,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:07,657 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-11 11:15:07,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:07,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:15:07,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:07,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:15:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:15:07,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:07,677 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-01-11 11:15:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:08,748 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-01-11 11:15:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:15:08,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:15:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:08,756 INFO L225 Difference]: With dead ends: 645 [2019-01-11 11:15:08,756 INFO L226 Difference]: Without dead ends: 643 [2019-01-11 11:15:08,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:15:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-11 11:15:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-01-11 11:15:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-01-11 11:15:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-01-11 11:15:08,867 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-01-11 11:15:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:08,868 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-01-11 11:15:08,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:15:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-01-11 11:15:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:08,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:08,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:08,869 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-01-11 11:15:08,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:08,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:08,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:08,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:08,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:08,962 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-11 11:15:08,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:08,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:08,963 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:08,963 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-01-11 11:15:08,964 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:08,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:08,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:08,966 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:08,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:08,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:08,967 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-11 11:15:08,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:08,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:09,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:09,019 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 21 treesize of output 24 [2019-01-11 11:15:09,060 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 24 treesize of output 26 [2019-01-11 11:15:09,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,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 26 treesize of output 36 [2019-01-11 11:15:09,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,079 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 28 treesize of output 50 [2019-01-11 11:15:09,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:15:09,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:15:09,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,124 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,147 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,218 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-11 11:15:09,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,234 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-11 11:15:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,271 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-11 11:15:09,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,318 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-11 11:15:09,318 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,334 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,348 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,364 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,395 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-11 11:15:09,395 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:15:09,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,495 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-11 11:15:09,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,520 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-11 11:15:09,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:15:09,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,559 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-11 11:15:09,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:09,659 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-11 11:15:09,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-01-11 11:15:09,701 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-11 11:15:09,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:09,717 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-11 11:15:09,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:09,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 11:15:09,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:09,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:15:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:15:09,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:09,738 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-01-11 11:15:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:10,307 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-01-11 11:15:10,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:10,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:15:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:10,314 INFO L225 Difference]: With dead ends: 527 [2019-01-11 11:15:10,314 INFO L226 Difference]: Without dead ends: 524 [2019-01-11 11:15:10,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:15:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-11 11:15:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-01-11 11:15:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-11 11:15:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-01-11 11:15:10,431 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-01-11 11:15:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:10,431 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-01-11 11:15:10,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:15:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-01-11 11:15:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:10,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:10,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:10,432 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-01-11 11:15:10,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:10,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:10,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:10,503 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-11 11:15:10,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:10,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:10,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:10,504 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-01-11 11:15:10,505 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:10,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:10,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:10,508 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:10,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:10,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:10,509 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-11 11:15:10,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:10,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:10,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:10,550 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 21 treesize of output 24 [2019-01-11 11:15:10,553 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 24 treesize of output 30 [2019-01-11 11:15:10,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,560 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 26 treesize of output 40 [2019-01-11 11:15:10,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:10,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,587 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:10,601 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 32 treesize of output 71 [2019-01-11 11:15:10,602 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,633 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,729 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-11 11:15:10,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,764 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-11 11:15:10,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:15:10,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,853 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-11 11:15:10,853 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,870 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,886 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,902 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:10,935 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-11 11:15:10,935 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:15:10,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:10,988 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-11 11:15:10,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,016 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-11 11:15:11,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:15:11,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,047 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-11 11:15:11,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,082 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-11 11:15:11,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:15:11,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,117 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:11,118 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 104 [2019-01-11 11:15:11,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,155 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-11 11:15:11,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:15:11,179 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-11 11:15:11,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:11,216 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-11 11:15:11,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:11,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:11,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:11,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:11,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:11,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:11,235 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-01-11 11:15:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:11,850 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-01-11 11:15:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:11,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:11,858 INFO L225 Difference]: With dead ends: 534 [2019-01-11 11:15:11,858 INFO L226 Difference]: Without dead ends: 533 [2019-01-11 11:15:11,859 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-11 11:15:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-11 11:15:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-01-11 11:15:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-11 11:15:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-01-11 11:15:11,999 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-01-11 11:15:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:11,999 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-01-11 11:15:11,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-01-11 11:15:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:12,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:12,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:12,000 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-01-11 11:15:12,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:12,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:12,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:12,059 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-11 11:15:12,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:12,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:12,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:12,060 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-01-11 11:15:12,060 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:12,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:12,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:12,063 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:12,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:12,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:12,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:12,064 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-11 11:15:12,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:12,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:12,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:12,082 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 21 treesize of output 24 [2019-01-11 11:15:12,086 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 24 treesize of output 26 [2019-01-11 11:15:12,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,095 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 26 treesize of output 36 [2019-01-11 11:15:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:15:12,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,123 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:15:12,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:15:12,140 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,279 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 63 treesize of output 56 [2019-01-11 11:15:12,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:15:12,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:15:12,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:15:12,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:15:12,495 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,519 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,543 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,568 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,594 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,638 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-11 11:15:12,638 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:15:12,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:15:12,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,746 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-11 11:15:12,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:15:12,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-11 11:15:12,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,827 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-11 11:15:12,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 11:15:12,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:12,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 114 [2019-01-11 11:15:12,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:12,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-11 11:15:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:12,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:12,973 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-11 11:15:12,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:12,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:12,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:12,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:12,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:12,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:12,993 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-01-11 11:15:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:13,599 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-01-11 11:15:13,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:13,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:13,605 INFO L225 Difference]: With dead ends: 543 [2019-01-11 11:15:13,605 INFO L226 Difference]: Without dead ends: 542 [2019-01-11 11:15:13,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-11 11:15:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-01-11 11:15:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-11 11:15:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-01-11 11:15:13,723 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-01-11 11:15:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:13,724 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-01-11 11:15:13,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-01-11 11:15:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:13,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:13,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:13,726 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:13,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-01-11 11:15:13,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:13,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:13,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:13,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:13,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:13,874 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:15:14,235 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-11 11:15:14,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:14,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:14,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:14,236 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-01-11 11:15:14,236 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:14,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:14,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:14,239 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:14,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:14,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:14,239 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-11 11:15:14,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:14,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:14,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:14,258 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 21 treesize of output 24 [2019-01-11 11:15:14,263 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 24 treesize of output 26 [2019-01-11 11:15:14,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,275 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 26 treesize of output 36 [2019-01-11 11:15:14,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,282 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 28 treesize of output 50 [2019-01-11 11:15:14,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:15:14,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:15:14,305 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,346 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,457 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 63 treesize of output 56 [2019-01-11 11:15:14,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,475 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 53 treesize of output 63 [2019-01-11 11:15:14,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:15:14,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:15:14,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:15:14,641 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,666 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,688 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,712 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,739 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,783 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-11 11:15:14,784 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:15:14,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:15:14,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,863 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-11 11:15:14,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:15:14,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-11 11:15:14,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,942 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-11 11:15:14,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 11:15:14,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,988 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:14,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 11:15:14,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:15,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-11 11:15:15,062 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-11 11:15:15,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:15,099 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-11 11:15:15,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:15,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:15,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:15,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:15,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:15,119 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-01-11 11:15:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:15,772 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-01-11 11:15:15,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:15,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:15,777 INFO L225 Difference]: With dead ends: 537 [2019-01-11 11:15:15,778 INFO L226 Difference]: Without dead ends: 536 [2019-01-11 11:15:15,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-11 11:15:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-01-11 11:15:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-11 11:15:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-01-11 11:15:15,897 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-01-11 11:15:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:15,897 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-01-11 11:15:15,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-01-11 11:15:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:15,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:15,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:15,898 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-01-11 11:15:15,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:15,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:15,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:15,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:15,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:16,333 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 11:15:16,371 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-11 11:15:16,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:16,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:16,371 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:16,371 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-01-11 11:15:16,372 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:16,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:16,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:16,374 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:16,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:16,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:16,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:16,375 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-11 11:15:16,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:16,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:16,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:16,458 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 21 treesize of output 24 [2019-01-11 11:15:16,461 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 24 treesize of output 30 [2019-01-11 11:15:16,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,464 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 26 treesize of output 40 [2019-01-11 11:15:16,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,472 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 28 treesize of output 54 [2019-01-11 11:15:16,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:16,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:16,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,530 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,636 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 68 treesize of output 71 [2019-01-11 11:15:16,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,677 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 58 treesize of output 67 [2019-01-11 11:15:16,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,725 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 46 treesize of output 72 [2019-01-11 11:15:16,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,785 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:15:16,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:15:16,860 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,885 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,911 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,937 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,962 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,019 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-11 11:15:17,019 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:15:17,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:15:17,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,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-11 11:15:17,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:15:17,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,152 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:17,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:15:17,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,201 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-11 11:15:17,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-11 11:15:17,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:15:17,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:17,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 11:15:17,322 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-11 11:15:17,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:17,376 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-11 11:15:17,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:17,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:17,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:17,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:17,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:17,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:17,396 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-01-11 11:15:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:18,103 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-01-11 11:15:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:18,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:18,111 INFO L225 Difference]: With dead ends: 588 [2019-01-11 11:15:18,111 INFO L226 Difference]: Without dead ends: 587 [2019-01-11 11:15:18,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-11 11:15:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-01-11 11:15:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-11 11:15:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-01-11 11:15:18,236 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-01-11 11:15:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:18,236 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-01-11 11:15:18,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-01-11 11:15:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:18,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:18,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:18,237 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:18,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-01-11 11:15:18,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:18,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:18,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:18,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:18,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:18,308 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-11 11:15:18,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:18,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:18,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:18,309 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-01-11 11:15:18,309 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:18,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:18,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:18,311 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:18,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:18,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:18,312 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-11 11:15:18,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:18,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:18,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:18,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:15:18,392 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 24 treesize of output 26 [2019-01-11 11:15:18,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,408 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 26 treesize of output 36 [2019-01-11 11:15:18,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,417 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 28 treesize of output 50 [2019-01-11 11:15:18,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:15:18,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:15:18,438 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:18,473 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:18,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:18,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:18,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:18,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:18,566 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 63 treesize of output 56 [2019-01-11 11:15:18,728 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 11:15:18,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,801 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 53 treesize of output 63 [2019-01-11 11:15:18,934 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-11 11:15:18,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:15:18,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:18,997 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:15:19,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:15:19,068 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,088 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,112 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,137 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,163 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,206 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-11 11:15:19,207 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:15:19,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:15:19,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,277 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-11 11:15:19,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:15:19,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,305 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:19,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-11 11:15:19,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:19,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-01-11 11:15:19,369 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-11 11:15:19,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:19,393 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-11 11:15:19,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:19,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:15:19,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:19,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:19,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:19,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:19,414 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-01-11 11:15:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:19,926 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-01-11 11:15:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:19,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:15:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:19,930 INFO L225 Difference]: With dead ends: 558 [2019-01-11 11:15:19,930 INFO L226 Difference]: Without dead ends: 557 [2019-01-11 11:15:19,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-11 11:15:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-01-11 11:15:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-01-11 11:15:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-11 11:15:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-01-11 11:15:20,070 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-01-11 11:15:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:20,070 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-01-11 11:15:20,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-01-11 11:15:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:20,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:20,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:20,072 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-01-11 11:15:20,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:20,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:20,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:20,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:20,159 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-11 11:15:20,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:20,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:20,159 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:20,160 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-01-11 11:15:20,160 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:20,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:20,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:20,162 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:20,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:20,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:20,163 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-11 11:15:20,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:20,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:20,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:20,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,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, 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-11 11:15:20,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 11:15:20,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,309 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-11 11:15:20,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,358 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-11 11:15:20,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,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, 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 24 [2019-01-11 11:15:20,437 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 24 treesize of output 30 [2019-01-11 11:15:20,440 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 26 treesize of output 40 [2019-01-11 11:15:20,443 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 28 treesize of output 54 [2019-01-11 11:15:20,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:20,455 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 32 treesize of output 71 [2019-01-11 11:15:20,455 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,481 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,501 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,517 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,530 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,542 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,575 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-11 11:15:20,575 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:15:20,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,614 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-11 11:15:20,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,641 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-11 11:15:20,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:15:20,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,668 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:20,669 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-11 11:15:20,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,702 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-11 11:15:20,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-11 11:15:20,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,733 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 90 [2019-01-11 11:15:20,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,767 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-11 11:15:20,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 11:15:20,787 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-11 11:15:20,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:20,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:20,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:15:20,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:20,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:20,829 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-01-11 11:15:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:21,530 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-01-11 11:15:21,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:21,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:21,534 INFO L225 Difference]: With dead ends: 795 [2019-01-11 11:15:21,534 INFO L226 Difference]: Without dead ends: 794 [2019-01-11 11:15:21,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-01-11 11:15:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-01-11 11:15:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-11 11:15:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-01-11 11:15:21,699 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-01-11 11:15:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:21,699 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-01-11 11:15:21,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-01-11 11:15:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:21,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:21,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:21,701 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-01-11 11:15:21,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:21,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:21,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:21,907 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-11 11:15:21,951 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-11 11:15:21,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:21,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:21,952 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:21,952 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-01-11 11:15:21,953 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:21,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:21,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:21,955 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:21,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:21,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:21,956 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-11 11:15:21,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:21,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:21,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:21,973 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 21 treesize of output 24 [2019-01-11 11:15:21,978 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 24 treesize of output 26 [2019-01-11 11:15:21,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:21,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:21,985 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 26 treesize of output 36 [2019-01-11 11:15:21,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:21,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:21,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:21,995 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 28 treesize of output 50 [2019-01-11 11:15:22,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,006 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:15:22,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:15:22,014 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,061 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:15:22,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,144 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-11 11:15:22,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,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, 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-11 11:15:22,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,241 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-11 11:15:22,241 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,254 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,268 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,285 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,315 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-11 11:15:22,316 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:15:22,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,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, 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-11 11:15:22,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:22,386 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-11 11:15:22,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:15:22,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:22,416 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:22,425 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 38 treesize of output 81 [2019-01-11 11:15:22,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:22,519 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-11 11:15:22,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-01-11 11:15:22,560 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-11 11:15:22,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:22,584 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-11 11:15:22,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:22,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 11:15:22,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:22,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:15:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:15:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:22,604 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-01-11 11:15:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:23,400 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-01-11 11:15:23,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:23,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:15:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:23,404 INFO L225 Difference]: With dead ends: 539 [2019-01-11 11:15:23,404 INFO L226 Difference]: Without dead ends: 538 [2019-01-11 11:15:23,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:15:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-11 11:15:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-01-11 11:15:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-11 11:15:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-01-11 11:15:23,613 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-01-11 11:15:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:23,613 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-01-11 11:15:23,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:15:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-01-11 11:15:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:23,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:23,614 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:15:23,615 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:23,615 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-01-11 11:15:23,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:23,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:23,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:23,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:23,704 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-11 11:15:23,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:23,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:23,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:23,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:23,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:23,705 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-11 11:15:23,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:23,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:23,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:23,744 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 21 treesize of output 24 [2019-01-11 11:15:23,749 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 24 treesize of output 30 [2019-01-11 11:15:23,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,755 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 26 treesize of output 40 [2019-01-11 11:15:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,764 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 28 treesize of output 54 [2019-01-11 11:15:23,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:23,781 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 32 treesize of output 71 [2019-01-11 11:15:23,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,922 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-11 11:15:23,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,954 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-11 11:15:23,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,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, 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-11 11:15:24,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,083 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-11 11:15:24,083 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:24,100 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:24,116 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:24,132 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:24,165 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-11 11:15:24,165 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:15:24,420 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 11:15:24,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:15:24,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:24,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-11 11:15:24,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-11 11:15:24,785 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-11 11:15:24,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,797 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 63 treesize of output 81 [2019-01-11 11:15:24,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:24,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:24,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 91 [2019-01-11 11:15:24,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:25,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 11:15:25,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-01-11 11:15:25,238 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-11 11:15:25,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,264 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 53 treesize of output 101 [2019-01-11 11:15:25,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 111 [2019-01-11 11:15:25,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,484 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 50 treesize of output 98 [2019-01-11 11:15:25,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 11:15:25,567 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-01-11 11:15:25,780 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-11 11:15:25,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 125 [2019-01-11 11:15:25,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:15:26,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,148 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 50 treesize of output 98 [2019-01-11 11:15:26,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,309 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:26,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,311 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 88 [2019-01-11 11:15:26,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 11:15:26,453 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-01-11 11:15:26,585 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-11 11:15:26,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:26,659 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-11 11:15:26,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:26,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:15:26,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:26,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:15:26,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:15:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:26,679 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-01-11 11:15:26,914 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-11 11:15:27,557 WARN L181 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-01-11 11:15:27,993 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-01-11 11:15:28,490 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-01-11 11:15:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:29,323 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-01-11 11:15:29,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:29,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:15:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:29,328 INFO L225 Difference]: With dead ends: 678 [2019-01-11 11:15:29,329 INFO L226 Difference]: Without dead ends: 673 [2019-01-11 11:15:29,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:15:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-01-11 11:15:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-01-11 11:15:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-11 11:15:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-01-11 11:15:29,568 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-01-11 11:15:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:29,569 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-01-11 11:15:29,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:15:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-01-11 11:15:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:29,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:29,570 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:15:29,570 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-01-11 11:15:29,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:29,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:29,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:29,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:29,753 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-11 11:15:29,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:29,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:29,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:29,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:29,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:29,754 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-11 11:15:29,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:15:29,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:15:29,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:15:29,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:29,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:29,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:15:29,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:15:29,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,804 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 26 treesize of output 40 [2019-01-11 11:15:29,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:29,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:29,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:29,830 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,873 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,974 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 68 treesize of output 71 [2019-01-11 11:15:30,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:15:30,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:15:30,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:15:30,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:15:30,209 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,235 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,261 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,288 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,314 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,361 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-11 11:15:30,362 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:15:30,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:15:30,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,443 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-11 11:15:30,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:15:30,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:15:30,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,574 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-11 11:15:30,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:15:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:15:30,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,672 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-11 11:15:30,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-01-11 11:15:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:30,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 135 [2019-01-11 11:15:30,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:30,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:30,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-01-11 11:15:30,803 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-11 11:15:30,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:30,850 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-11 11:15:30,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:30,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:15:30,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:30,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:15:30,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:15:30,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:30,870 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-01-11 11:15:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:31,715 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-01-11 11:15:31,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:31,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:15:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:31,720 INFO L225 Difference]: With dead ends: 704 [2019-01-11 11:15:31,721 INFO L226 Difference]: Without dead ends: 703 [2019-01-11 11:15:31,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:15:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-11 11:15:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-01-11 11:15:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-01-11 11:15:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-01-11 11:15:31,937 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-01-11 11:15:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:31,937 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-01-11 11:15:31,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:15:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-01-11 11:15:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:31,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:31,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:31,939 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:31,939 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-01-11 11:15:31,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:31,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:31,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:31,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:32,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:32,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:32,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:32,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:32,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:32,143 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-11 11:15:32,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:15:32,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:15:32,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:15:32,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:32,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:32,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 21 treesize of output 24 [2019-01-11 11:15:32,189 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 24 treesize of output 30 [2019-01-11 11:15:32,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,193 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 26 treesize of output 40 [2019-01-11 11:15:32,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,199 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 28 treesize of output 54 [2019-01-11 11:15:32,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,221 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:32,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:32,232 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,276 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,299 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,377 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 68 treesize of output 71 [2019-01-11 11:15:32,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,424 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 58 treesize of output 67 [2019-01-11 11:15:32,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,469 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 46 treesize of output 72 [2019-01-11 11:15:32,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:15:32,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:15:32,610 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,635 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,660 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,684 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,709 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,756 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-11 11:15:32,757 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:15:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:15:32,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,842 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-11 11:15:32,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:15:32,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:15:32,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:32,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-11 11:15:32,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:15:32,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,962 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:32,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:32,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:15:32,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:33,014 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-11 11:15:33,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:15:33,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,053 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:33,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-11 11:15:33,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:33,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:33,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 11:15:33,131 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-11 11:15:33,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:33,182 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-11 11:15:33,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:33,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:15:33,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:33,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:15:33,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:15:33,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:33,200 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-01-11 11:15:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:34,541 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-01-11 11:15:34,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:15:34,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:15:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:34,550 INFO L225 Difference]: With dead ends: 1218 [2019-01-11 11:15:34,550 INFO L226 Difference]: Without dead ends: 1217 [2019-01-11 11:15:34,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:15:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-11 11:15:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-01-11 11:15:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-01-11 11:15:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-01-11 11:15:34,962 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-01-11 11:15:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:34,962 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-01-11 11:15:34,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:15:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-01-11 11:15:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:34,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:34,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:34,963 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:34,964 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-01-11 11:15:34,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:34,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:34,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:35,050 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-11 11:15:35,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:35,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:35,051 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:35,051 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-01-11 11:15:35,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:35,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:35,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:35,053 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:35,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:35,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:35,054 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-11 11:15:35,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:35,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:35,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:35,107 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 21 treesize of output 24 [2019-01-11 11:15:35,109 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 24 treesize of output 30 [2019-01-11 11:15:35,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:15:35,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,127 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 28 treesize of output 54 [2019-01-11 11:15:35,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,133 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:35,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:35,146 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,212 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,292 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 68 treesize of output 71 [2019-01-11 11:15:35,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,333 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 58 treesize of output 67 [2019-01-11 11:15:35,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,381 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 46 treesize of output 72 [2019-01-11 11:15:35,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,440 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:15:35,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:15:35,512 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,538 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,564 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,590 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,679 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-11 11:15:35,679 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:15:35,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:15:35,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,757 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-11 11:15:35,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:15:35,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,793 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:35,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:15:35,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,842 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-11 11:15:35,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-01-11 11:15:35,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:35,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:15:35,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:35,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:35,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-01-11 11:15:35,950 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-11 11:15:35,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:35,986 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-11 11:15:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:36,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:36,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:36,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:36,005 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-01-11 11:15:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:36,818 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-01-11 11:15:36,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:36,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:36,823 INFO L225 Difference]: With dead ends: 814 [2019-01-11 11:15:36,823 INFO L226 Difference]: Without dead ends: 811 [2019-01-11 11:15:36,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-11 11:15:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-01-11 11:15:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-01-11 11:15:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-01-11 11:15:37,114 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-01-11 11:15:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:37,114 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-01-11 11:15:37,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-01-11 11:15:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:37,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:37,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:37,115 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-01-11 11:15:37,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:37,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:37,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:37,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:37,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:37,316 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-11 11:15:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:37,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:37,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:37,333 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:37,333 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-01-11 11:15:37,333 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:37,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:37,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:37,335 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:37,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:37,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:37,336 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-11 11:15:37,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:37,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:37,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:37,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,376 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-11 11:15:37,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,410 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-11 11:15:37,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,447 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-11 11:15:37,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,498 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-11 11:15:37,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,574 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 21 treesize of output 24 [2019-01-11 11:15:37,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:15:37,581 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 26 treesize of output 40 [2019-01-11 11:15:37,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:37,589 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:37,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:15:37,619 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,645 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,666 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,681 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,695 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,739 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-11 11:15:37,739 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:15:37,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,794 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-11 11:15:37,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,824 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-11 11:15:37,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:15:37,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:37,857 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-11 11:15:37,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:37,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 11:15:37,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:37,923 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:37,924 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-11 11:15:37,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,953 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-11 11:15:37,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:15:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:37,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:38,011 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-11 11:15:38,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:38,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:15:38,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:38,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:15:38,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:15:38,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:38,029 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-01-11 11:15:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:38,878 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-01-11 11:15:38,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:38,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:15:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:38,881 INFO L225 Difference]: With dead ends: 812 [2019-01-11 11:15:38,881 INFO L226 Difference]: Without dead ends: 811 [2019-01-11 11:15:38,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-11 11:15:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-01-11 11:15:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-11 11:15:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-01-11 11:15:39,178 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-01-11 11:15:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:39,178 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-01-11 11:15:39,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:15:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-01-11 11:15:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:39,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:39,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:39,179 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-01-11 11:15:39,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:39,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:39,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:39,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:39,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:39,248 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-11 11:15:39,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:39,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:39,248 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:39,249 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-01-11 11:15:39,249 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:39,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:39,251 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:39,251 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:39,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:39,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:39,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 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-11 11:15:39,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:39,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:39,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:39,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:15:39,292 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 24 treesize of output 26 [2019-01-11 11:15:39,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,297 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 26 treesize of output 36 [2019-01-11 11:15:39,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,304 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 28 treesize of output 50 [2019-01-11 11:15:39,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:15:39,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:15:39,327 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,363 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,454 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 63 treesize of output 56 [2019-01-11 11:15:39,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,474 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 53 treesize of output 63 [2019-01-11 11:15:39,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:15:39,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:15:39,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:15:39,660 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,683 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,705 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,729 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,756 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:39,796 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-11 11:15:39,796 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:15:39,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:15:39,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:39,983 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-11 11:15:39,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 11:15:40,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,104 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-11 11:15:40,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,140 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-11 11:15:40,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-01-11 11:15:40,160 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-11 11:15:40,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:40,176 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-11 11:15:40,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:40,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:15:40,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:40,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:15:40,196 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-01-11 11:15:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:40,863 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-01-11 11:15:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:40,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:15:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:40,865 INFO L225 Difference]: With dead ends: 843 [2019-01-11 11:15:40,865 INFO L226 Difference]: Without dead ends: 842 [2019-01-11 11:15:40,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:15:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-11 11:15:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-01-11 11:15:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-11 11:15:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-01-11 11:15:41,182 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-01-11 11:15:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:41,183 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-01-11 11:15:41,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:41,183 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-01-11 11:15:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:41,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:41,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:41,184 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:41,185 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-01-11 11:15:41,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:41,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:41,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:41,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:41,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:41,267 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-11 11:15:41,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:41,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:41,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:41,268 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-01-11 11:15:41,268 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:41,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:41,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:41,271 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:41,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:41,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:41,271 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-11 11:15:41,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:41,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:41,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:41,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:15:41,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,341 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-11 11:15:41,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,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, 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-11 11:15:41,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,438 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-11 11:15:41,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,552 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 21 treesize of output 24 [2019-01-11 11:15:41,555 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 24 treesize of output 30 [2019-01-11 11:15:41,558 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 26 treesize of output 40 [2019-01-11 11:15:41,560 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 28 treesize of output 54 [2019-01-11 11:15:41,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:41,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:15:41,570 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,595 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,615 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,644 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,656 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:41,687 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-11 11:15:41,688 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:15:41,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:41,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:15:41,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:41,907 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-11 11:15:41,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-11 11:15:42,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,359 INFO L303 Elim1Store]: Index analysis took 347 ms [2019-01-11 11:15:42,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 103 [2019-01-11 11:15:42,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:15:42,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:42,802 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:42,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2019-01-11 11:15:42,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:42,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-01-11 11:15:42,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-01-11 11:15:43,254 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-01-11 11:15:43,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-01-11 11:15:43,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,390 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:43,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,392 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 100 [2019-01-11 11:15:43,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,524 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:43,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,525 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 94 [2019-01-11 11:15:43,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,647 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:43,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:15:43,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-11 11:15:43,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-01-11 11:15:43,926 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-01-11 11:15:43,930 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-11 11:15:43,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:43,987 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-11 11:15:44,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:44,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:44,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:44,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:44,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:44,007 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-01-11 11:15:44,193 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-11 11:15:44,416 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-11 11:15:45,035 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-01-11 11:15:45,774 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-01-11 11:15:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:46,102 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-01-11 11:15:46,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:46,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:46,105 INFO L225 Difference]: With dead ends: 896 [2019-01-11 11:15:46,106 INFO L226 Difference]: Without dead ends: 895 [2019-01-11 11:15:46,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:15:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-11 11:15:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-01-11 11:15:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-01-11 11:15:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-01-11 11:15:46,455 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-01-11 11:15:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:46,455 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-01-11 11:15:46,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-01-11 11:15:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:46,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:46,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:46,457 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:46,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:46,457 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-01-11 11:15:46,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:46,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:46,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:46,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:46,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:46,522 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-11 11:15:46,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:46,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:46,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:46,523 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-01-11 11:15:46,524 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:46,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:46,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:46,526 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:46,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:46,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:46,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:15:46,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:46,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:46,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:46,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,568 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-11 11:15:46,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 11:15:46,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:15:46,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,693 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-11 11:15:46,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,768 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 21 treesize of output 24 [2019-01-11 11:15:46,771 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 24 treesize of output 30 [2019-01-11 11:15:46,774 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 26 treesize of output 40 [2019-01-11 11:15:46,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:46,780 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:46,789 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 32 treesize of output 71 [2019-01-11 11:15:46,789 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,814 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,834 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,863 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,875 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,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-11 11:15:46,908 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:15:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,951 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-11 11:15:46,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,983 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-11 11:15:46,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:15:47,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:15:47,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:47,047 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-11 11:15:47,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 11:15:47,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:47,350 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:47,350 INFO L303 Elim1Store]: Index analysis took 285 ms [2019-01-11 11:15:47,351 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-11 11:15:47,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:47,519 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-11 11:15:47,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:15:47,539 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-11 11:15:47,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:47,571 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-11 11:15:47,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:47,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:47,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:47,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:47,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:47,591 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-01-11 11:15:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:48,613 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-01-11 11:15:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:48,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:15:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:48,617 INFO L225 Difference]: With dead ends: 975 [2019-01-11 11:15:48,617 INFO L226 Difference]: Without dead ends: 973 [2019-01-11 11:15:48,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-01-11 11:15:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-01-11 11:15:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-11 11:15:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-01-11 11:15:48,985 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-01-11 11:15:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:48,986 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-01-11 11:15:48,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-01-11 11:15:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:48,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:48,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:48,988 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-01-11 11:15:48,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:48,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:49,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-11 11:15:49,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:49,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:49,079 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:49,079 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-01-11 11:15:49,080 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:49,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:49,081 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:49,082 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:49,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:49,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:49,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:49,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 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-11 11:15:49,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:49,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:49,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:49,100 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 21 treesize of output 24 [2019-01-11 11:15:49,104 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 24 treesize of output 26 [2019-01-11 11:15:49,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,116 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 26 treesize of output 36 [2019-01-11 11:15:49,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,126 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 28 treesize of output 50 [2019-01-11 11:15:49,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:15:49,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, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:15:49,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,274 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-11 11:15:49,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:15:49,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:15:49,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,403 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-11 11:15:49,404 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,419 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,450 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,481 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-11 11:15:49,481 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:15:49,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,526 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-11 11:15:49,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:49,620 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-11 11:15:49,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 11:15:49,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,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, 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 86 [2019-01-11 11:15:49,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,734 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:49,735 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 59 [2019-01-11 11:15:49,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,780 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-11 11:15:49,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-01-11 11:15:49,952 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-11 11:15:49,957 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-11 11:15:49,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:49,976 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-11 11:15:49,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:49,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:15:49,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:49,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:49,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:49,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:15:49,996 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-01-11 11:15:50,353 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-11 11:15:54,502 WARN L181 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-11 11:15:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:55,331 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-01-11 11:15:55,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:55,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:15:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:55,334 INFO L225 Difference]: With dead ends: 985 [2019-01-11 11:15:55,334 INFO L226 Difference]: Without dead ends: 984 [2019-01-11 11:15:55,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-01-11 11:15:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-01-11 11:15:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-11 11:15:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-01-11 11:15:55,719 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-01-11 11:15:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:55,720 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-01-11 11:15:55,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-01-11 11:15:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:15:55,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:55,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:15:55,722 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:55,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-01-11 11:15:55,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:55,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:55,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:55,824 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-11 11:15:55,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:55,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:55,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:15:55,824 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-01-11 11:15:55,825 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:55,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:55,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:55,827 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:15:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:55,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:55,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:55,828 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-11 11:15:55,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:55,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:55,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:55,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,863 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 68 treesize of output 71 [2019-01-11 11:15:55,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:15:55,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,951 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 46 treesize of output 72 [2019-01-11 11:15:56,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,009 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:15:56,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:15:56,084 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,112 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:15:56,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:15:56,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:15:56,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:56,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:56,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:56,247 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,280 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,301 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,317 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,331 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,343 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,389 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-11 11:15:56,389 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:15:56,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:15:56,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,478 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-11 11:15:56,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:15:56,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:15:56,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,571 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-11 11:15:56,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:15:56,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,617 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:56,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:15:56,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,671 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-11 11:15:56,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:15:56,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,713 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:56,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-11 11:15:56,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:56,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 11:15:56,798 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-11 11:15:56,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:57,520 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-11 11:15:57,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:57,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:15:57,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:57,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:15:57,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:15:57,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:57,539 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-01-11 11:16:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:03,461 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-01-11 11:16:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:03,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:16:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:03,466 INFO L225 Difference]: With dead ends: 1024 [2019-01-11 11:16:03,466 INFO L226 Difference]: Without dead ends: 1023 [2019-01-11 11:16:03,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:16:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-01-11 11:16:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-01-11 11:16:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-01-11 11:16:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-01-11 11:16:03,858 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-01-11 11:16:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:03,858 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-01-11 11:16:03,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-01-11 11:16:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:03,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:03,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:03,860 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:03,860 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-01-11 11:16:03,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:03,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:03,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:03,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:03,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:04,022 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-11 11:16:04,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:04,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:04,022 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:04,023 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-01-11 11:16:04,023 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:04,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:04,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:04,025 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:16:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:04,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:04,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:04,026 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-11 11:16:04,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:04,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:04,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:04,061 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 21 treesize of output 24 [2019-01-11 11:16:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:16:04,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,073 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 26 treesize of output 40 [2019-01-11 11:16:04,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,083 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 28 treesize of output 54 [2019-01-11 11:16:04,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:04,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:04,100 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,139 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,237 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 68 treesize of output 71 [2019-01-11 11:16:04,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,277 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 58 treesize of output 67 [2019-01-11 11:16:04,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,324 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 46 treesize of output 72 [2019-01-11 11:16:04,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,382 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:16:04,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:16:04,456 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,481 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,507 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,533 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,560 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,607 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-11 11:16:04,607 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:16:04,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:16:04,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,721 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-11 11:16:04,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:16:04,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:16:04,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,813 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-11 11:16:04,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:16:04,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,858 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:04,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:16:04,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,909 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-11 11:16:04,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:16:04,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,953 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:04,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-11 11:16:04,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:05,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:05,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-11 11:16:05,030 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-11 11:16:05,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:05,086 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-11 11:16:05,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:05,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:16:05,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:05,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:05,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:05,105 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-01-11 11:16:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:06,444 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-01-11 11:16:06,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:16:06,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:16:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:06,449 INFO L225 Difference]: With dead ends: 1059 [2019-01-11 11:16:06,449 INFO L226 Difference]: Without dead ends: 1057 [2019-01-11 11:16:06,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:16:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-11 11:16:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-01-11 11:16:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-11 11:16:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-01-11 11:16:06,856 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-01-11 11:16:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:06,856 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-01-11 11:16:06,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-01-11 11:16:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:06,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:06,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:06,857 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-01-11 11:16:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:06,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:06,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:07,005 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-11 11:16:07,041 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-11 11:16:07,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:07,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:07,042 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:07,042 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-01-11 11:16:07,044 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:07,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:07,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:07,046 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:16:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:07,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:07,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:07,047 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-11 11:16:07,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:07,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:07,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:07,081 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 21 treesize of output 24 [2019-01-11 11:16:07,084 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 24 treesize of output 30 [2019-01-11 11:16:07,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,089 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 26 treesize of output 40 [2019-01-11 11:16:07,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,095 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 28 treesize of output 54 [2019-01-11 11:16:07,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,104 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:07,111 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 32 treesize of output 71 [2019-01-11 11:16:07,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,140 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,196 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,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, 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-11 11:16:07,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,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, 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-11 11:16:07,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,311 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-11 11:16:07,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,361 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-11 11:16:07,362 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,379 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,395 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,411 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,444 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-11 11:16:07,445 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-11 11:16:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:16:07,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,543 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-11 11:16:07,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:16:07,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,580 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-11 11:16:07,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,612 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-11 11:16:07,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-11 11:16:07,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,648 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:07,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,650 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-11 11:16:07,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,686 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-11 11:16:07,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 11:16:07,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,720 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:07,721 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 100 [2019-01-11 11:16:07,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,757 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-11 11:16:07,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:07,780 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-11 11:16:07,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:07,839 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-11 11:16:07,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:07,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:16:07,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:07,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:07,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:07,859 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-01-11 11:16:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:09,943 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-01-11 11:16:09,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:09,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:16:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:09,948 INFO L225 Difference]: With dead ends: 1044 [2019-01-11 11:16:09,948 INFO L226 Difference]: Without dead ends: 1042 [2019-01-11 11:16:09,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:16:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-01-11 11:16:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-01-11 11:16:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-01-11 11:16:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-01-11 11:16:10,372 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-01-11 11:16:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:10,373 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-01-11 11:16:10,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-01-11 11:16:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:10,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:10,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:10,374 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-01-11 11:16:10,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:10,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:10,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:10,509 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-11 11:16:10,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:10,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:10,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:16:10,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:16:10,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:10,510 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-11 11:16:10,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:16:10,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:16:10,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:16:10,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:16:10,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:10,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,559 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 68 treesize of output 71 [2019-01-11 11:16:10,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:16:10,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:16:10,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,699 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:16:10,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:16:10,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:16:10,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:16:10,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:16:10,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:16:10,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:10,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:10,933 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,970 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,991 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:11,007 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:11,021 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:11,033 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:11,079 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-11 11:16:11,079 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:16:11,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:16:11,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:11,168 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-11 11:16:11,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:16:11,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:16:11,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:11,263 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-11 11:16:11,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:16:11,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,309 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:11,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:16:11,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:11,362 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-11 11:16:11,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 11:16:11,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,406 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:11,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:11,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:16:11,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:11,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:11,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 11:16:11,662 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-11 11:16:11,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:11,721 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-11 11:16:11,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:11,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:16:11,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:11,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:11,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:11,741 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-01-11 11:16:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:13,027 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-01-11 11:16:13,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:13,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:16:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:13,032 INFO L225 Difference]: With dead ends: 1044 [2019-01-11 11:16:13,032 INFO L226 Difference]: Without dead ends: 1041 [2019-01-11 11:16:13,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:16:13,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-11 11:16:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-01-11 11:16:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-01-11 11:16:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-01-11 11:16:13,447 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-01-11 11:16:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:13,447 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-01-11 11:16:13,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-01-11 11:16:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:13,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:13,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:13,449 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-01-11 11:16:13,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:13,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:13,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:16:13,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:13,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:13,542 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-11 11:16:13,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:13,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:13,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:13,543 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-01-11 11:16:13,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:13,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:13,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:13,546 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:16:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:13,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:13,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:13,546 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-11 11:16:13,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:13,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:13,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:13,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 21 treesize of output 24 [2019-01-11 11:16:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:16:13,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,602 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 26 treesize of output 40 [2019-01-11 11:16:13,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:16:13,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:13,637 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 32 treesize of output 71 [2019-01-11 11:16:13,638 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,667 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,690 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,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 48 treesize of output 54 [2019-01-11 11:16:13,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,801 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-11 11:16:13,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,840 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-11 11:16:13,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:13,891 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-11 11:16:13,892 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,909 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,925 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,940 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:13,974 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-11 11:16:13,974 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:16:14,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:16:14,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:14,193 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-11 11:16:14,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-11 11:16:14,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,320 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:14,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2019-01-11 11:16:14,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:14,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,477 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:14,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2019-01-11 11:16:14,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-11 11:16:14,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-01-11 11:16:14,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 95 [2019-01-11 11:16:14,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:14,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,875 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 55 treesize of output 93 [2019-01-11 11:16:14,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,996 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 86 [2019-01-11 11:16:14,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:15,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-01-11 11:16:15,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-01-11 11:16:15,226 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-11 11:16:15,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,271 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 46 treesize of output 102 [2019-01-11 11:16:15,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:15,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,406 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:15,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 118 [2019-01-11 11:16:15,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-11 11:16:15,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,708 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:15,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, 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 92 [2019-01-11 11:16:15,709 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:15,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,874 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:15,875 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 98 [2019-01-11 11:16:15,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:16,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 11:16:16,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-01-11 11:16:16,253 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-01-11 11:16:16,255 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-11 11:16:16,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:16,351 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-11 11:16:16,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:16,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:16:16,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:16,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:16,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:16,371 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-01-11 11:16:16,551 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-11 11:16:16,823 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-11 11:16:17,231 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-01-11 11:16:17,670 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-11 11:16:18,323 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-01-11 11:16:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:19,225 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-01-11 11:16:19,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:19,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:16:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:19,229 INFO L225 Difference]: With dead ends: 1104 [2019-01-11 11:16:19,229 INFO L226 Difference]: Without dead ends: 1102 [2019-01-11 11:16:19,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:16:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-01-11 11:16:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-01-11 11:16:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-01-11 11:16:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-01-11 11:16:19,675 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-01-11 11:16:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:19,675 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-01-11 11:16:19,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-01-11 11:16:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:19,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:19,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:19,677 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:19,677 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-01-11 11:16:19,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:19,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:19,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:19,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:19,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:19,786 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-11 11:16:19,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:19,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:19,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:19,786 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-01-11 11:16:19,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:19,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:19,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:19,790 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:16:19,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:19,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:19,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:19,791 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-11 11:16:19,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:19,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:19,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:19,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,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, 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-11 11:16:19,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,916 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-11 11:16:19,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:16:20,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,012 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-11 11:16:20,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,107 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 21 treesize of output 24 [2019-01-11 11:16:20,110 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 24 treesize of output 30 [2019-01-11 11:16:20,113 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 26 treesize of output 40 [2019-01-11 11:16:20,115 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 28 treesize of output 54 [2019-01-11 11:16:20,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:20,125 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 32 treesize of output 71 [2019-01-11 11:16:20,125 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,151 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,170 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,186 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,199 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,244 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-11 11:16:20,244 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:16:20,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,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, 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-11 11:16:20,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,347 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-11 11:16:20,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:16:20,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,378 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:20,379 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-11 11:16:20,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,411 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-11 11:16:20,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-01-11 11:16:20,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,444 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-11 11:16:20,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,475 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-11 11:16:20,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 11:16:20,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,509 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:20,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,511 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-11 11:16:20,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,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-11 11:16:20,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-01-11 11:16:20,568 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-11 11:16:20,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:20,616 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-11 11:16:20,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:20,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:16:20,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:20,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:20,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:20,636 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-01-11 11:16:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:22,995 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-01-11 11:16:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:16:22,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:16:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:23,001 INFO L225 Difference]: With dead ends: 1313 [2019-01-11 11:16:23,001 INFO L226 Difference]: Without dead ends: 1312 [2019-01-11 11:16:23,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:16:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-11 11:16:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-01-11 11:16:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-01-11 11:16:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-01-11 11:16:23,413 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-01-11 11:16:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:23,413 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-01-11 11:16:23,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-01-11 11:16:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:23,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:23,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:23,415 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-01-11 11:16:23,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:23,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:23,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:23,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:23,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:23,485 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-11 11:16:23,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:23,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:23,486 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:23,486 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-01-11 11:16:23,486 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:23,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:23,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:23,488 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:23,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:23,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:23,489 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-11 11:16:23,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:23,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:23,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:23,506 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 21 treesize of output 24 [2019-01-11 11:16:23,510 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 24 treesize of output 26 [2019-01-11 11:16:23,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:16:23,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,524 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 28 treesize of output 50 [2019-01-11 11:16:23,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,535 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:16:23,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:23,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:16:23,547 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:24,040 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:24,328 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:24,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:24,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:24,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,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 63 treesize of output 56 [2019-01-11 11:16:25,286 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 11:16:25,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,295 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 53 treesize of output 63 [2019-01-11 11:16:25,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:16:25,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:16:25,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:16:25,461 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,484 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,508 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,533 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,560 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,604 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-11 11:16:25,605 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:16:25,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:16:25,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,682 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-11 11:16:25,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:16:25,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-11 11:16:25,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,765 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-11 11:16:25,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-11 11:16:25,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:25,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 11:16:25,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:25,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-11 11:16:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:25,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:25,974 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-11 11:16:25,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:25,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:16:25,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:25,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:25,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:25,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:16:25,992 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-01-11 11:16:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:26,948 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-01-11 11:16:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:26,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:16:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:26,951 INFO L225 Difference]: With dead ends: 881 [2019-01-11 11:16:26,951 INFO L226 Difference]: Without dead ends: 880 [2019-01-11 11:16:26,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-11 11:16:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-01-11 11:16:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-01-11 11:16:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-01-11 11:16:27,353 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-01-11 11:16:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:27,353 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-01-11 11:16:27,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-01-11 11:16:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:27,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:27,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:27,355 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:27,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-01-11 11:16:27,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:27,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:27,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:27,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:27,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:27,441 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-11 11:16:27,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:27,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:27,441 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:27,441 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-01-11 11:16:27,442 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:27,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:27,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:27,444 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:27,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:27,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:27,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:16:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:27,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:27,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:27,471 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 21 treesize of output 24 [2019-01-11 11:16:27,474 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 24 treesize of output 26 [2019-01-11 11:16:27,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,481 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 26 treesize of output 36 [2019-01-11 11:16:27,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:16:27,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:16:27,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:16:27,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,536 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,626 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-11 11:16:27,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,643 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-11 11:16:27,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,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, 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-11 11:16:27,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,726 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-11 11:16:27,727 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,742 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,757 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,804 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-11 11:16:27,804 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:16:27,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,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-11 11:16:27,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:27,873 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-11 11:16:27,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:16:27,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:27,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, 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-11 11:16:27,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:28,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:16:28,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 11:16:28,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,059 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:28,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, 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-11 11:16:28,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,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-11 11:16:28,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-11 11:16:28,099 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-11 11:16:28,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:28,122 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-11 11:16:28,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:28,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:16:28,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:28,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:28,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:28,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:28,141 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-01-11 11:16:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:29,373 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-01-11 11:16:29,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:29,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:16:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:29,378 INFO L225 Difference]: With dead ends: 1415 [2019-01-11 11:16:29,379 INFO L226 Difference]: Without dead ends: 1413 [2019-01-11 11:16:29,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:16:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-01-11 11:16:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-01-11 11:16:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-01-11 11:16:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-01-11 11:16:30,078 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-01-11 11:16:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:30,078 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-01-11 11:16:30,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-01-11 11:16:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:30,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:30,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:30,081 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-01-11 11:16:30,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:30,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:30,172 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-11 11:16:30,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:30,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:30,173 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:30,173 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-01-11 11:16:30,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:30,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:30,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:30,175 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:30,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:30,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:30,176 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-11 11:16:30,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:30,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:30,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:30,193 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-11 11:16:30,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,213 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-11 11:16:30,352 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-11 11:16:30,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,359 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-11 11:16:30,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,406 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-11 11:16:30,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,475 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 21 treesize of output 24 [2019-01-11 11:16:30,480 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 24 treesize of output 26 [2019-01-11 11:16:30,485 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 26 treesize of output 36 [2019-01-11 11:16:30,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:16:30,493 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:16:30,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:16:30,501 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,526 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,545 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,560 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,571 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,583 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:30,614 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-11 11:16:30,614 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:16:30,821 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-11 11:16:30,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:30,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:16:30,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-11 11:16:31,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-11 11:16:31,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:349 [2019-01-11 11:16:31,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,422 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:31,432 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 58 treesize of output 99 [2019-01-11 11:16:31,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:31,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,611 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:31,620 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 58 treesize of output 93 [2019-01-11 11:16:31,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:31,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,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 45 treesize of output 61 [2019-01-11 11:16:31,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-11 11:16:31,910 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:162, output treesize:180 [2019-01-11 11:16:32,029 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-01-11 11:16:32,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,038 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 75 [2019-01-11 11:16:32,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:32,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,109 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-11 11:16:32,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:32,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:32,168 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:32,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, 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 61 [2019-01-11 11:16:32,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:32,215 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-11 11:16:32,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-01-11 11:16:34,303 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-11 11:16:34,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:34,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:34,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:16:34,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:34,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=112, Unknown=1, NotChecked=0, Total=182 [2019-01-11 11:16:34,364 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-01-11 11:16:34,740 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-11 11:16:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:40,331 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-01-11 11:16:40,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:16:40,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:16:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:40,336 INFO L225 Difference]: With dead ends: 1381 [2019-01-11 11:16:40,336 INFO L226 Difference]: Without dead ends: 1379 [2019-01-11 11:16:40,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=107, Invalid=198, Unknown=1, NotChecked=0, Total=306 [2019-01-11 11:16:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-01-11 11:16:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-01-11 11:16:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-11 11:16:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-11 11:16:41,048 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-11 11:16:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:41,048 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-11 11:16:41,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-11 11:16:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:41,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:41,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:41,050 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:41,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-01-11 11:16:41,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:41,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:41,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:41,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:41,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:41,102 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-11 11:16:41,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:41,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:41,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:41,103 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-01-11 11:16:41,103 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:41,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:41,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:41,105 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:16:41,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:41,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:41,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:41,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 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-11 11:16:41,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:41,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:41,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:41,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:16:41,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,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 53 treesize of output 63 [2019-01-11 11:16:41,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,197 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 46 treesize of output 68 [2019-01-11 11:16:41,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,272 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:16:41,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:16:41,339 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,370 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,484 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 21 treesize of output 24 [2019-01-11 11:16:41,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:16:41,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:16:41,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:16:41,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:16:41,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:16:41,523 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,558 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,577 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,592 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,604 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,616 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,660 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-11 11:16:41,660 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:16:41,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:16:41,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,727 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-11 11:16:41,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:16:41,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,758 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:41,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:16:41,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:41,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 11:16:41,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-01-11 11:16:41,963 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-11 11:16:41,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:41,986 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-11 11:16:42,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:42,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:16:42,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:42,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:16:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:16:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:16:42,006 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-01-11 11:16:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:43,164 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-01-11 11:16:43,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:16:43,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:16:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:43,168 INFO L225 Difference]: With dead ends: 1306 [2019-01-11 11:16:43,168 INFO L226 Difference]: Without dead ends: 1305 [2019-01-11 11:16:43,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-11 11:16:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-01-11 11:16:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-01-11 11:16:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-11 11:16:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-11 11:16:43,826 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-11 11:16:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:43,826 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-11 11:16:43,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:16:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-11 11:16:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:43,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:43,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:43,829 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:43,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-01-11 11:16:43,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:43,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:43,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:43,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:43,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:43,998 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-01-11 11:16:44,058 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-11 11:16:44,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:44,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:44,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:44,059 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-01-11 11:16:44,060 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:44,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:44,061 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:44,062 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:16:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:44,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:44,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:44,062 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-11 11:16:44,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:44,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:44,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:44,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,101 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 68 treesize of output 71 [2019-01-11 11:16:44,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:16:44,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,182 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 46 treesize of output 72 [2019-01-11 11:16:44,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,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, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:16:44,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:16:44,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,344 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:16:44,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:16:44,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:16:44,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:16:44,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:44,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:44,492 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,526 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,546 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,562 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,575 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,587 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,633 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-11 11:16:44,634 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:16:44,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:16:44,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,725 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-11 11:16:44,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:16:44,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,768 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:44,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:16:44,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,819 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-11 11:16:44,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-01-11 11:16:44,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:16:44,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,947 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-11 11:16:44,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-01-11 11:16:44,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:44,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-11 11:16:44,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:45,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:45,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 11:16:45,071 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-11 11:16:45,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:45,131 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-11 11:16:45,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:45,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:16:45,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:45,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:45,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:45,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:45,149 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-01-11 11:16:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:46,699 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-01-11 11:16:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:46,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:16:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:46,704 INFO L225 Difference]: With dead ends: 1360 [2019-01-11 11:16:46,704 INFO L226 Difference]: Without dead ends: 1358 [2019-01-11 11:16:46,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:16:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-11 11:16:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-01-11 11:16:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-01-11 11:16:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-01-11 11:16:47,422 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-01-11 11:16:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:47,422 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-01-11 11:16:47,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-01-11 11:16:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:47,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:47,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:47,424 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:47,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-01-11 11:16:47,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:47,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:47,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:47,625 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-11 11:16:47,667 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-11 11:16:47,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:47,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:47,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:16:47,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:16:47,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:47,668 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-11 11:16:47,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:16:47,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:16:47,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:16:47,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:16:47,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:47,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,708 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 68 treesize of output 71 [2019-01-11 11:16:47,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:16:47,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:16:47,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:16:47,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:47,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:16:47,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:47,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:16:48,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:16:48,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:16:48,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:16:48,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:48,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:48,491 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,529 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,551 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,567 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,579 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,639 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-11 11:16:48,639 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:16:48,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:16:48,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,718 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-11 11:16:48,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:16:48,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:16:48,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,799 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-11 11:16:48,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:16:48,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:48,837 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:48,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:16:48,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:48,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:48,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-11 11:16:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:48,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:48,940 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-11 11:16:48,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:48,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:16:48,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:48,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:48,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:48,959 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-01-11 11:16:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:50,749 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-01-11 11:16:50,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:50,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:16:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:50,755 INFO L225 Difference]: With dead ends: 1898 [2019-01-11 11:16:50,755 INFO L226 Difference]: Without dead ends: 1896 [2019-01-11 11:16:50,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:16:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-11 11:16:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-01-11 11:16:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-01-11 11:16:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-01-11 11:16:51,787 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-01-11 11:16:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:51,787 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-01-11 11:16:51,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-01-11 11:16:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:51,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:51,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:51,791 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:51,792 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-01-11 11:16:51,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:51,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:51,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:16:51,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:51,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:51,893 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-11 11:16:51,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:16:51,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:16:51,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:16:51,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:16:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:16:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:16:51,894 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-01-11 11:16:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:52,991 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-01-11 11:16:52,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:16:52,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-11 11:16:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:52,996 INFO L225 Difference]: With dead ends: 1693 [2019-01-11 11:16:52,996 INFO L226 Difference]: Without dead ends: 1692 [2019-01-11 11:16:52,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:16:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-01-11 11:16:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-01-11 11:16:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-11 11:16:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-01-11 11:16:54,064 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-01-11 11:16:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:54,064 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-01-11 11:16:54,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:16:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-01-11 11:16:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:54,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:54,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:54,067 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:54,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:54,067 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-01-11 11:16:54,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:54,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:54,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:54,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:54,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:54,115 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-11 11:16:54,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:54,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:54,115 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:54,115 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-01-11 11:16:54,116 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:54,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:54,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:54,118 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:16:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:54,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:54,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:54,119 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-11 11:16:54,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:54,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:54,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:54,137 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 21 treesize of output 24 [2019-01-11 11:16:54,143 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 24 treesize of output 26 [2019-01-11 11:16:54,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,156 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 26 treesize of output 36 [2019-01-11 11:16:54,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,167 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 28 treesize of output 50 [2019-01-11 11:16:54,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,180 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:16:54,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:16:54,192 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,332 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 63 treesize of output 56 [2019-01-11 11:16:54,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,354 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 53 treesize of output 63 [2019-01-11 11:16:54,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,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 46 treesize of output 68 [2019-01-11 11:16:54,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,457 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:16:54,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:16:54,526 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,551 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,576 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,600 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,627 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:54,670 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-11 11:16:54,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:16:54,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,738 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-11 11:16:54,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:16:54,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:54,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 99 [2019-01-11 11:16:54,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:54,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:54,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-01-11 11:16:54,835 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-11 11:16:54,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:54,847 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-11 11:16:54,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:54,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:16:54,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:54,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:16:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:16:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:16:54,866 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-01-11 11:16:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:56,952 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-01-11 11:16:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:56,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:16:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:56,960 INFO L225 Difference]: With dead ends: 2759 [2019-01-11 11:16:56,960 INFO L226 Difference]: Without dead ends: 2757 [2019-01-11 11:16:56,961 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-11 11:16:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-01-11 11:16:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-01-11 11:16:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-01-11 11:16:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-01-11 11:16:58,700 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-01-11 11:16:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:58,701 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-01-11 11:16:58,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:16:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-01-11 11:16:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:16:58,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:58,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:16:58,704 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-01-11 11:16:58,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:58,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:58,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:58,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:58,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:58,835 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-11 11:16:58,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:58,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:58,836 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:16:58,837 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-01-11 11:16:58,838 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:58,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:58,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:58,839 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:16:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:58,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:58,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:58,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 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-11 11:16:58,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:58,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:58,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:58,891 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 21 treesize of output 24 [2019-01-11 11:16:58,894 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 24 treesize of output 30 [2019-01-11 11:16:58,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,898 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 26 treesize of output 40 [2019-01-11 11:16:58,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,906 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 28 treesize of output 54 [2019-01-11 11:16:58,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,916 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:58,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:58,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:58,926 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:58,969 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:58,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,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 68 treesize of output 71 [2019-01-11 11:16:59,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,111 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 58 treesize of output 67 [2019-01-11 11:16:59,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,158 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 46 treesize of output 72 [2019-01-11 11:16:59,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,217 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:16:59,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:16:59,290 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,317 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,342 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,369 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,393 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,441 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-11 11:16:59,442 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:16:59,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:16:59,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,521 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-11 11:16:59,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:16:59,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,559 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:59,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:16:59,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,606 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-11 11:16:59,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-11 11:16:59,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:16:59,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,689 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-11 11:16:59,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-11 11:16:59,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,731 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:59,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:59,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:16:59,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:59,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:59,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 11:16:59,812 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-11 11:16:59,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:59,857 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-11 11:16:59,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:59,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:16:59,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:59,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:59,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:59,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:59,876 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-01-11 11:17:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:03,410 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-01-11 11:17:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:17:03,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:17:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:03,421 INFO L225 Difference]: With dead ends: 3636 [2019-01-11 11:17:03,422 INFO L226 Difference]: Without dead ends: 3626 [2019-01-11 11:17:03,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:17:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-11 11:17:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-01-11 11:17:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-01-11 11:17:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-01-11 11:17:05,938 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-01-11 11:17:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:05,938 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-01-11 11:17:05,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:17:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-01-11 11:17:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:17:05,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:05,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:17:05,942 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:05,942 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-01-11 11:17:05,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:05,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:05,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:06,000 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-11 11:17:06,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:06,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:06,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:06,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:06,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:06,001 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-11 11:17:06,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:17:06,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:17:06,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:17:06,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:06,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:06,020 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 21 treesize of output 24 [2019-01-11 11:17:06,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:17:06,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,033 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 26 treesize of output 36 [2019-01-11 11:17:06,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:17:06,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:17:06,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:17:06,063 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:17:06,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:17:06,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,260 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 46 treesize of output 68 [2019-01-11 11:17:06,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:17:06,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:17:06,387 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,412 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,436 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,461 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,488 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,533 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-11 11:17:06,534 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:17:06,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:17:06,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,606 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-11 11:17:06,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:17:06,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:17:06,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:17:06,808 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-11 11:17:06,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-01-11 11:17:06,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:06,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:06,929 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-11 11:17:06,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:06,968 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-11 11:17:06,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-01-11 11:17:06,985 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-11 11:17:06,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:07,024 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-11 11:17:07,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:07,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:17:07,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:07,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:17:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:17:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:17:07,044 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-01-11 11:17:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:11,100 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-01-11 11:17:11,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:17:11,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:17:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:11,112 INFO L225 Difference]: With dead ends: 4300 [2019-01-11 11:17:11,112 INFO L226 Difference]: Without dead ends: 4298 [2019-01-11 11:17:11,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:17:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-01-11 11:17:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-01-11 11:17:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-01-11 11:17:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-01-11 11:17:14,852 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-01-11 11:17:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:14,852 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-01-11 11:17:14,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:17:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-01-11 11:17:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:17:14,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:14,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:14,859 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-01-11 11:17:14,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:14,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:14,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:14,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:14,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:14,937 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-11 11:17:14,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:14,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:14,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:17:14,937 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-01-11 11:17:14,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:14,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:14,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:14,940 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:17:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:14,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:14,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:14,940 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-11 11:17:14,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:14,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:14,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:14,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:17:14,978 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 24 treesize of output 30 [2019-01-11 11:17:14,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,982 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 26 treesize of output 40 [2019-01-11 11:17:14,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:17:14,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:14,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:17:15,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:17:15,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,049 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,072 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,150 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 68 treesize of output 71 [2019-01-11 11:17:15,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,189 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 58 treesize of output 67 [2019-01-11 11:17:15,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,235 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 46 treesize of output 72 [2019-01-11 11:17:15,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,294 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:17:15,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:17:15,366 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,406 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,433 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,462 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,492 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,537 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-11 11:17:15,537 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:17:15,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:17:15,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,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-11 11:17:15,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:17:15,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:17:15,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,789 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-11 11:17:15,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 11:17:15,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,836 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:15,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 11:17:15,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,885 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-11 11:17:15,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 11:17:15,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,927 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:15,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:15,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:17:15,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:15,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:15,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 11:17:16,010 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-11 11:17:16,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:16,065 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-11 11:17:16,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:16,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:17:16,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:16,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:17:16,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:17:16,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:17:16,084 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-01-11 11:17:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:20,379 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-01-11 11:17:20,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:17:20,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:17:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:20,391 INFO L225 Difference]: With dead ends: 4236 [2019-01-11 11:17:20,392 INFO L226 Difference]: Without dead ends: 4233 [2019-01-11 11:17:20,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:17:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-01-11 11:17:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-01-11 11:17:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-01-11 11:17:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-01-11 11:17:24,230 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-01-11 11:17:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:24,230 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-01-11 11:17:24,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:17:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-01-11 11:17:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:17:24,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:24,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:24,236 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-01-11 11:17:24,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:24,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:24,340 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-11 11:17:24,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:24,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:24,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:17:24,341 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-01-11 11:17:24,342 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:24,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:24,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:24,346 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:17:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:24,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:24,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:24,347 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-11 11:17:24,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:24,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:24,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:24,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,384 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-11 11:17:24,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,417 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-11 11:17:24,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,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, 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-11 11:17:24,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,518 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-11 11:17:24,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,591 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 21 treesize of output 24 [2019-01-11 11:17: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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:17:24,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:17:24,601 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 28 treesize of output 54 [2019-01-11 11:17:24,603 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:17:24,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:17:24,612 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,637 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,657 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,673 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,687 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,732 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-11 11:17:24,732 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-11 11:17:24,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,799 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-11 11:17:24,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:24,827 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-11 11:17:24,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:17:24,966 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 11:17:24,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:24,976 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-11 11:17:24,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:25,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:25,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:17:25,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,054 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:25,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, 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-11 11:17:25,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:25,092 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-11 11:17:25,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 11:17:25,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:25,130 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:25,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 11:17:25,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:25,167 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-11 11:17:25,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:17:25,194 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-11 11:17:25,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:25,259 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-11 11:17:25,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:25,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:17:25,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:25,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:17:25,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:17:25,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:25,277 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-01-11 11:17:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:29,435 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-01-11 11:17:29,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:17:29,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:17:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:29,449 INFO L225 Difference]: With dead ends: 4232 [2019-01-11 11:17:29,449 INFO L226 Difference]: Without dead ends: 4231 [2019-01-11 11:17:29,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:17:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-01-11 11:17:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-01-11 11:17:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-01-11 11:17:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-01-11 11:17:33,211 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-01-11 11:17:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:33,211 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-01-11 11:17:33,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:17:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-01-11 11:17:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:17:33,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:33,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:33,217 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-01-11 11:17:33,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:33,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:33,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:33,291 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-11 11:17:33,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:33,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:33,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:17:33,292 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-01-11 11:17:33,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:33,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:33,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:33,295 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:17:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:33,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:33,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:33,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 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-11 11:17:33,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:33,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:33,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:33,313 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 63 treesize of output 56 [2019-01-11 11:17:33,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,337 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 53 treesize of output 63 [2019-01-11 11:17:33,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:17:33,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,449 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:17:33,599 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-01-11 11:17:33,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:33,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:17:33,620 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,774 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 21 treesize of output 24 [2019-01-11 11:17:33,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:17:33,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:17:33,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:17:33,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:17:33,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:17:33,848 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,879 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,899 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,913 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,925 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,937 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:33,981 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-11 11:17:33,981 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:17:34,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:17:34,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:34,058 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-11 11:17:34,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:17:34,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:17:34,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:17:34,259 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-11 11:17:34,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-01-11 11:17:34,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,341 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:34,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:34,343 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-11 11:17:34,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:34,380 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-11 11:17:34,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 11:17:34,404 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-11 11:17:34,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:34,436 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-11 11:17:34,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:34,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:17:34,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:34,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:17:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:17:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:17:34,455 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-01-11 11:17:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:38,670 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-01-11 11:17:38,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:17:38,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:17:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:38,683 INFO L225 Difference]: With dead ends: 4570 [2019-01-11 11:17:38,684 INFO L226 Difference]: Without dead ends: 4569 [2019-01-11 11:17:38,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-01-11 11:17:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-01-11 11:17:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-01-11 11:17:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-01-11 11:17:42,656 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-01-11 11:17:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:42,656 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-01-11 11:17:42,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:17:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-01-11 11:17:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:17:42,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:42,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:42,663 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:42,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-01-11 11:17:42,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:42,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:42,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:42,931 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 19 [2019-01-11 11:17:43,052 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-11 11:17:43,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:43,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:43,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:17:43,053 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-01-11 11:17:43,054 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:43,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:43,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:43,056 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:17:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:43,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:43,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:43,056 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-11 11:17:43,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:43,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:43,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:43,092 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 21 treesize of output 24 [2019-01-11 11:17:43,095 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 24 treesize of output 30 [2019-01-11 11:17:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,099 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 26 treesize of output 40 [2019-01-11 11:17:43,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,104 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 28 treesize of output 54 [2019-01-11 11:17:43,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:17:43,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:17:43,120 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,160 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,266 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 68 treesize of output 71 [2019-01-11 11:17:43,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,306 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 58 treesize of output 67 [2019-01-11 11:17:43,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,352 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 46 treesize of output 72 [2019-01-11 11:17:43,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,411 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:17:43,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:17:43,484 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,511 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,536 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,590 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,636 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-11 11:17:43,636 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:17:43,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:43,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:17:43,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:43,725 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-11 11:17:43,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:17:44,046 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-11 11:17:44,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:17:44,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:44,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-11 11:17:44,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 11:17:44,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,156 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:44,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:17:44,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:44,209 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-11 11:17:44,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:17:44,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:44,260 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:44,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 131 [2019-01-11 11:17:44,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:44,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:44,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-11 11:17:44,343 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-11 11:17:44,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:44,433 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-11 11:17:44,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:44,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:17:44,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:44,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:17:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:17:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:17:44,454 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-01-11 11:17:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:50,490 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-01-11 11:17:50,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:17:50,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:17:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:50,508 INFO L225 Difference]: With dead ends: 5928 [2019-01-11 11:17:50,509 INFO L226 Difference]: Without dead ends: 5927 [2019-01-11 11:17:50,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:17:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-01-11 11:17:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-01-11 11:17:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-01-11 11:17:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-01-11 11:17:55,899 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-01-11 11:17:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:55,900 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-01-11 11:17:55,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:17:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-01-11 11:17:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:17:55,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:55,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:55,907 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-01-11 11:17:55,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:55,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:55,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:55,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:55,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:56,043 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-11 11:17:56,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:56,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:56,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:17:56,044 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-01-11 11:17:56,045 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:56,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:56,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:56,047 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:17:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:56,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:56,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:56,048 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-11 11:17:56,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:56,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:56,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:56,099 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 21 treesize of output 24 [2019-01-11 11:17:56,136 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 24 treesize of output 26 [2019-01-11 11:17:56,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,226 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 26 treesize of output 36 [2019-01-11 11:17:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,286 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 28 treesize of output 50 [2019-01-11 11:17:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:17:56,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:17:56,306 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,338 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,423 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-11 11:17:56,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,440 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-11 11:17:56,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,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-11 11:17:56,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,528 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-11 11:17:56,528 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,543 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,558 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,605 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-11 11:17:56,606 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 11:17:56,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,656 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-11 11:17:56,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,682 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-11 11:17:56,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:17:56,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,723 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-11 11:17:56,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:17:56,823 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-11 11:17:56,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-11 11:17:56,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:56,879 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-11 11:17:56,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,958 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:56,959 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-11 11:17:56,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,007 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-11 11:17:57,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 11:17:57,098 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-11 11:17:57,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:57,131 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-11 11:17:57,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:57,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:17:57,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:57,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:17:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:17:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:17:57,150 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-01-11 11:17:57,417 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-11 11:18:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:04,203 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-01-11 11:18:04,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:18:04,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:18:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:04,224 INFO L225 Difference]: With dead ends: 6511 [2019-01-11 11:18:04,224 INFO L226 Difference]: Without dead ends: 6510 [2019-01-11 11:18:04,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:18:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-11 11:18:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-01-11 11:18:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-01-11 11:18:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-01-11 11:18:11,291 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-01-11 11:18:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:11,291 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-01-11 11:18:11,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:18:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-01-11 11:18:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:18:11,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:11,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:11,300 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-01-11 11:18:11,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:11,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:11,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:11,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:11,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:11,771 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-11 11:18:11,967 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-11 11:18:11,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:11,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:11,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:18:11,968 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-01-11 11:18:11,968 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:11,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:11,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:11,970 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:18:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:11,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:11,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:11,970 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-11 11:18:11,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:11,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:11,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:11,989 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 63 treesize of output 56 [2019-01-11 11:18:12,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,009 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 53 treesize of output 63 [2019-01-11 11:18:12,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,048 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 46 treesize of output 68 [2019-01-11 11:18:12,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,103 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:18:12,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:18:12,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,308 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 21 treesize of output 24 [2019-01-11 11:18:12,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:18:12,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:18:12,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, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:18:12,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:18:12,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:18:12,344 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,379 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,398 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,413 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,425 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,481 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-11 11:18:12,482 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-01-11 11:18:12,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,557 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-11 11:18:12,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,585 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-11 11:18:12,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:18:12,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,626 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-11 11:18:12,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,658 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-11 11:18:12,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:18:12,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,701 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:12,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,703 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-11 11:18:12,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,739 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-11 11:18:12,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 11:18:12,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,782 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:12,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, 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 100 [2019-01-11 11:18:12,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,819 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-11 11:18:12,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:18:12,848 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-11 11:18:12,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:12,924 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-11 11:18:12,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:12,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 11:18:12,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:12,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:18:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:18:12,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:18:12,944 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-01-11 11:18:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:21,851 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-01-11 11:18:21,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:18:21,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:18:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:21,873 INFO L225 Difference]: With dead ends: 7179 [2019-01-11 11:18:21,873 INFO L226 Difference]: Without dead ends: 7170 [2019-01-11 11:18:21,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:18:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-01-11 11:18:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-01-11 11:18:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-01-11 11:18:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-01-11 11:18:29,055 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-01-11 11:18:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:29,055 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-01-11 11:18:29,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:18:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-01-11 11:18:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:18:29,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:29,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:29,062 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:29,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-01-11 11:18:29,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:29,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:29,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:29,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:29,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:29,110 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-11 11:18:29,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:29,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:29,111 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:18:29,112 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-01-11 11:18:29,112 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:29,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:29,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:29,114 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:18:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:29,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:29,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:29,115 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-11 11:18:29,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:29,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:29,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:29,134 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 38 treesize of output 37 [2019-01-11 11:18:29,137 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 37 treesize of output 36 [2019-01-11 11:18:29,143 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 36 treesize of output 35 [2019-01-11 11:18:29,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,168 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-11 11:18:29,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-01-11 11:18:29,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,275 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,315 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 21 treesize of output 24 [2019-01-11 11:18:29,318 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 24 treesize of output 26 [2019-01-11 11:18:29,399 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 26 treesize of output 28 [2019-01-11 11:18:29,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-11 11:18:29,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-11 11:18:29,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:18:29,427 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,451 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,463 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,475 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,487 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,499 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:29,531 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-01-11 11:18:29,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-01-11 11:18:29,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:18:29,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-01-11 11:18:29,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:333 [2019-01-11 11:18:29,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:29,932 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 42 [2019-01-11 11:18:29,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:29,946 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-11 11:18:29,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-11 11:18:29,959 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-11 11:18:29,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:29,986 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-11 11:18:30,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:30,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:18:30,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:30,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:18:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:18:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:18:30,006 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-01-11 11:18:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:39,871 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-01-11 11:18:39,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:18:39,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:18:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:39,910 INFO L225 Difference]: With dead ends: 10441 [2019-01-11 11:18:39,910 INFO L226 Difference]: Without dead ends: 10440 [2019-01-11 11:18:39,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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-11 11:18:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-01-11 11:18:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-01-11 11:18:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-01-11 11:18:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-01-11 11:18:50,734 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-01-11 11:18:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:50,734 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-01-11 11:18:50,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:18:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-01-11 11:18:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:18:50,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:50,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:50,745 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:50,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-01-11 11:18:50,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:50,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:50,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:50,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:50,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:50,894 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-11 11:18:50,929 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-11 11:18:50,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:50,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:50,929 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:18:50,930 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-01-11 11:18:50,930 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:50,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:50,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:50,932 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:18:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:50,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:50,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:50,933 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-11 11:18:50,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:50,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:50,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:50,951 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 21 treesize of output 24 [2019-01-11 11:18:50,953 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 24 treesize of output 26 [2019-01-11 11:18:50,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,960 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 26 treesize of output 36 [2019-01-11 11:18:50,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,967 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 28 treesize of output 50 [2019-01-11 11:18:50,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:18:50,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:50,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:18:50,987 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,026 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:18:51,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,137 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 53 treesize of output 63 [2019-01-11 11:18:51,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:18:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,239 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:18:51,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:18:51,310 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,333 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,357 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,382 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,409 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:51,453 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:18:51,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:18:51,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,524 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-11 11:18:51,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:18:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,558 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:51,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-11 11:18:51,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:51,604 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-11 11:18:51,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-01-11 11:18:51,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:51,654 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:51,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 108 [2019-01-11 11:18:51,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:18:51,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 11:18:51,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-01-11 11:18:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:51,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:51,902 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-11 11:18:51,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:51,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:18:51,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:51,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:18:51,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:18:51,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:18:51,921 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-01-11 11:19:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:02,284 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-01-11 11:19:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:19:02,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:19:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:02,333 INFO L225 Difference]: With dead ends: 10427 [2019-01-11 11:19:02,333 INFO L226 Difference]: Without dead ends: 10426 [2019-01-11 11:19:02,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:19:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-01-11 11:19:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-01-11 11:19:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-01-11 11:19:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-01-11 11:19:13,178 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-01-11 11:19:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:13,178 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-01-11 11:19:13,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:19:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-01-11 11:19:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:19:13,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:13,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:13,189 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-01-11 11:19:13,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:13,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:13,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:13,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:13,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:13,312 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-11 11:19:13,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:13,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:13,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:19:13,312 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-01-11 11:19:13,313 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:19:13,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:19:13,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:19:13,315 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:19:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:13,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:19:13,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:13,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:19:13,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:13,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:19:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:13,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:13,339 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 21 treesize of output 24 [2019-01-11 11:19:13,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:19:13,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,347 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 26 treesize of output 36 [2019-01-11 11:19:13,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,354 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 28 treesize of output 50 [2019-01-11 11:19:13,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:19:13,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, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:19:13,372 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,399 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,448 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,485 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-11 11:19:13,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,501 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-11 11:19:13,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,539 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-11 11:19:13,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,584 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-11 11:19:13,584 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,600 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,614 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:19:13,661 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 11:19:13,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,714 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-11 11:19:13,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,732 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-11 11:19:13,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:19:13,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:13,758 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-11 11:19:13,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,779 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-11 11:19:13,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-11 11:19:13,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,809 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-11 11:19:13,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,830 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-11 11:19:13,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 11:19:13,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,860 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:13,860 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-11 11:19:13,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,885 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-11 11:19:13,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 11:19:13,909 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-11 11:19:13,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:13,965 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-11 11:19:13,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:13,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:19:13,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:13,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:19:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:19:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:19:13,984 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-01-11 11:19:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:24,853 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-01-11 11:19:24,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:19:24,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:19:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:24,896 INFO L225 Difference]: With dead ends: 11408 [2019-01-11 11:19:24,896 INFO L226 Difference]: Without dead ends: 11406 [2019-01-11 11:19:24,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:19:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-01-11 11:19:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-01-11 11:19:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-11 11:19:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-01-11 11:19:36,470 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-01-11 11:19:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:36,470 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-01-11 11:19:36,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:19:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-01-11 11:19:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:19:36,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:36,481 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:19:36,481 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-01-11 11:19:36,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:36,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:36,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:36,629 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-01-11 11:19:36,710 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-11 11:19:36,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:36,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:36,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:19:36,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:19:36,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:36,711 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-11 11:19:36,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:19:36,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:19:36,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:19:36,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:19:36,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:36,752 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 21 treesize of output 24 [2019-01-11 11:19:36,768 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 24 treesize of output 30 [2019-01-11 11:19:36,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,808 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 26 treesize of output 40 [2019-01-11 11:19:36,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,897 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 28 treesize of output 54 [2019-01-11 11:19:36,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:36,992 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:19:37,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:19:37,094 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,132 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,155 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,235 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 68 treesize of output 71 [2019-01-11 11:19:37,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,277 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 58 treesize of output 67 [2019-01-11 11:19:37,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,321 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 46 treesize of output 72 [2019-01-11 11:19:37,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:19:37,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:19:37,452 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,478 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,504 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,530 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,557 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,603 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-11 11:19:37,604 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:19:37,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:19:37,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,685 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-11 11:19:37,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:19:37,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:19:37,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:19:37,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 11:19:37,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,886 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:37,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-11 11:19:37,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:37,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:19:37,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-01-11 11:19:37,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,981 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:37,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:37,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:19:37,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:38,034 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-11 11:19:38,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-01-11 11:19:38,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:38,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-11 11:19:38,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:38,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:19:38,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-01-11 11:19:38,162 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-11 11:19:38,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:38,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:38,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 11:19:38,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:38,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:19:38,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:19:38,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:19:38,254 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-01-11 11:19:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:52,883 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-01-11 11:19:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:19:52,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:19:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:52,932 INFO L225 Difference]: With dead ends: 14692 [2019-01-11 11:19:52,933 INFO L226 Difference]: Without dead ends: 14688 [2019-01-11 11:19:52,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:19:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-01-11 11:20:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-01-11 11:20:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-01-11 11:20:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-01-11 11:20:06,508 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-01-11 11:20:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:20:06,508 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-01-11 11:20:06,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:20:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-01-11 11:20:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:20:06,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:20:06,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:20:06,519 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:20:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:06,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-01-11 11:20:06,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:20:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:06,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:20:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:06,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:20:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:06,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-11 11:20:06,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:06,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:20:06,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:20:06,566 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-01-11 11:20:06,567 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:20:06,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:20:06,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:20:06,569 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:20:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:06,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:20:06,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:06,570 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-11 11:20:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:06,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:20:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:06,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:20:06,609 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 21 treesize of output 24 [2019-01-11 11:20:06,612 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 24 treesize of output 26 [2019-01-11 11:20:06,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,618 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 26 treesize of output 36 [2019-01-11 11:20:06,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,626 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 28 treesize of output 50 [2019-01-11 11:20:06,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,635 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:20:06,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:20:06,644 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:06,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:06,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:06,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:06,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:06,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:06,776 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 63 treesize of output 56 [2019-01-11 11:20:06,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,796 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 53 treesize of output 63 [2019-01-11 11:20:06,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,840 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 46 treesize of output 68 [2019-01-11 11:20:06,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:20:06,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:06,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:20:06,963 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:06,987 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:07,011 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:07,036 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:07,063 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:07,106 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-11 11:20:07,107 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:20:07,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:20:07,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:07,179 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-11 11:20:07,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:20:07,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2019-01-11 11:20:07,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:07,259 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-11 11:20:07,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 11:20:07,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,320 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:07,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:07,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:20:07,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:07,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:20:07,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-11 11:20:07,392 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-11 11:20:07,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:20:07,423 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-11 11:20:07,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:20:07,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:20:07,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:20:07,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:20:07,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:20:07,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:20:07,442 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-01-11 11:20:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:20:20,150 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-01-11 11:20:20,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:20:20,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:20:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:20:20,196 INFO L225 Difference]: With dead ends: 13016 [2019-01-11 11:20:20,196 INFO L226 Difference]: Without dead ends: 13015 [2019-01-11 11:20:20,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:20:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-01-11 11:20:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-01-11 11:20:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-11 11:20:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-11 11:20:34,156 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-11 11:20:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:20:34,157 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-11 11:20:34,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:20:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-11 11:20:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:20:34,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:20:34,169 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:20:34,169 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:20:34,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-01-11 11:20:34,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:20:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:34,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:20:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:34,386 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-11 11:20:34,395 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-11 11:20:34,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:34,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:20:34,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:20:34,396 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-01-11 11:20:34,397 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:20:34,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:20:34,398 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:20:34,399 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:20:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:34,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:20:34,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:34,399 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-11 11:20:34,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:34,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:20:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:34,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:20:34,415 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 21 treesize of output 24 [2019-01-11 11:20:34,418 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 24 treesize of output 26 [2019-01-11 11:20:34,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,426 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 26 treesize of output 36 [2019-01-11 11:20:34,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,432 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 28 treesize of output 50 [2019-01-11 11:20:34,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:20:34,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:20:34,450 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,500 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,567 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-11 11:20:34,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,584 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-11 11:20:34,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,620 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-11 11:20:34,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,667 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-11 11:20:34,667 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,681 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,696 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,712 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:20:34,743 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 11:20:34,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,783 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-11 11:20:34,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:20:34,882 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-11 11:20:34,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 11:20:34,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,928 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-11 11:20:34,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,950 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-11 11:20:34,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-01-11 11:20:34,965 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-11 11:20:34,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:20:34,981 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-11 11:20:34,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:20:34,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:20:34,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:20:34,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:20:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:20:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:20:34,999 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-01-11 11:20:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:20:47,383 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-01-11 11:20:47,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:20:47,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 11:20:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:20:47,430 INFO L225 Difference]: With dead ends: 12974 [2019-01-11 11:20:47,430 INFO L226 Difference]: Without dead ends: 12973 [2019-01-11 11:20:47,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:20:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-01-11 11:21:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-01-11 11:21:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-11 11:21:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-11 11:21:01,348 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-11 11:21:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:21:01,348 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-11 11:21:01,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:21:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-11 11:21:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:21:01,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:21:01,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:21:01,358 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:21:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-01-11 11:21:01,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:21:01,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:01,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:01,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:01,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:21:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:01,426 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-11 11:21:01,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:01,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:21:01,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:21:01,427 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-01-11 11:21:01,428 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:21:01,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:21:01,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:21:01,430 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:21:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:01,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:21:01,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:01,430 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:21:01,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:01,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:21:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:01,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:21:01,448 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 21 treesize of output 24 [2019-01-11 11:21:01,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:21:01,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:21:01,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,465 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 28 treesize of output 50 [2019-01-11 11:21:01,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:21:01,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:21:01,487 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,544 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,616 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 63 treesize of output 56 [2019-01-11 11:21:01,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:21:01,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:21:01,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,734 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:21:01,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:21:01,806 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,830 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,854 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,879 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,906 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:01,952 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-11 11:21:01,952 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:21:01,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:01,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:21:01,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:21:02,145 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-11 11:21:02,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-11 11:21:02,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,207 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:02,207 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-11 11:21:02,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:02,245 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-11 11:21:02,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-11 11:21:02,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:02,275 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-11 11:21:02,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:02,310 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-11 11:21:02,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-11 11:21:02,335 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-11 11:21:02,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:21:02,370 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-11 11:21:02,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:21:02,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:21:02,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:21:02,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:21:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:21:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:21:02,388 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-01-11 11:21:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:21:15,304 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-01-11 11:21:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:21:15,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:21:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:21:15,350 INFO L225 Difference]: With dead ends: 13106 [2019-01-11 11:21:15,350 INFO L226 Difference]: Without dead ends: 13105 [2019-01-11 11:21:15,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:21:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-01-11 11:21:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-01-11 11:21:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-01-11 11:21:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-01-11 11:21:29,138 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-01-11 11:21:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:21:29,138 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-01-11 11:21:29,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:21:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-01-11 11:21:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:21:29,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:21:29,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:21:29,148 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:21:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-01-11 11:21:29,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:21:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:29,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:29,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:21:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:29,227 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-11 11:21:29,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:29,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:21:29,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:21:29,228 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-01-11 11:21:29,228 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:21:29,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:21:29,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:21:29,230 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:21:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:29,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:21:29,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:29,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:21:29,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:29,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:21:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:29,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:21:29,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:21:29,442 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 24 treesize of output 30 [2019-01-11 11:21:29,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:21:29,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:21:29,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:21:29,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:21:29,469 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,506 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,527 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:21:29,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,651 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 58 treesize of output 67 [2019-01-11 11:21:29,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,698 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 46 treesize of output 72 [2019-01-11 11:21:29,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:21:29,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:29,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:21:29,828 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,855 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,881 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,907 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,934 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:29,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:21:29,981 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:21:30,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:21:30,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:30,069 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-11 11:21:30,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:21:30,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,131 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:30,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:21:30,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:30,179 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-11 11:21:30,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-11 11:21:30,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:21:30,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:30,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-11 11:21:30,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-11 11:21:30,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:30,317 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:30,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:21:30,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:30,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:21:30,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-11 11:21:30,401 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-11 11:21:30,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:21:30,466 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-11 11:21:30,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:21:30,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:21:30,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:21:30,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:21:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:21:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:21:30,485 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-01-11 11:21:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:21:43,690 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-01-11 11:21:43,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:21:43,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:21:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:21:43,738 INFO L225 Difference]: With dead ends: 13278 [2019-01-11 11:21:43,738 INFO L226 Difference]: Without dead ends: 13277 [2019-01-11 11:21:43,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:21:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-01-11 11:21:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-01-11 11:21:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-01-11 11:21:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-01-11 11:21:57,818 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-01-11 11:21:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:21:57,818 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-01-11 11:21:57,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:21:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-01-11 11:21:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:21:57,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:21:57,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:21:57,829 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:21:57,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-01-11 11:21:57,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:21:57,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:57,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:57,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:57,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:21:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:58,006 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-11 11:21:58,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:58,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:21:58,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:21:58,007 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-01-11 11:21:58,007 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:21:58,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:21:58,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:21:58,010 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:21:58,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:58,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:21:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:58,011 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:21:58,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:58,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:21:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:58,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:21:58,050 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 21 treesize of output 24 [2019-01-11 11:21:58,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:21:58,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,057 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 26 treesize of output 40 [2019-01-11 11:21:58,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:21:58,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:21:58,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:21:58,080 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,109 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,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, 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-11 11:21:58,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,242 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-11 11:21:58,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:21:58,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,332 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-11 11:21:58,333 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,350 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,365 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,381 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:21:58,415 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:21:58,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,469 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-11 11:21:58,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,500 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-11 11:21:58,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:21:58,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:58,536 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-11 11:21:58,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,569 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-11 11:21:58,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 11:21:58,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,603 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-11 11:21:58,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,637 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-11 11:21:58,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 11:21:58,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:58,675 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:58,675 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-11 11:21:58,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:58,711 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-11 11:21:58,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:21:58,738 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-11 11:21:58,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:21:58,791 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-11 11:21:58,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:21:58,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 11:21:58,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:21:58,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:21:58,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:21:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:21:58,810 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-01-11 11:22:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:22:15,483 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-01-11 11:22:15,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:22:15,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:22:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:22:15,545 INFO L225 Difference]: With dead ends: 17581 [2019-01-11 11:22:15,545 INFO L226 Difference]: Without dead ends: 17580 [2019-01-11 11:22:15,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:22:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-01-11 11:22:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-01-11 11:22:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-11 11:22:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-11 11:22:26,637 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-11 11:22:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:22:26,637 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-11 11:22:26,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:22:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-11 11:22:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:22:26,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:22:26,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:22:26,647 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:22:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:22:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-01-11 11:22:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:22:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:22:26,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:22:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:22:26,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:22:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:22:26,721 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-11 11:22:26,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:22:26,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:22:26,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:22:26,722 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-01-11 11:22:26,722 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:22:26,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:22:26,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:22:26,724 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:22:26,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:22:26,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:22:26,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:22:26,724 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:22:26,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:22:26,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:22:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:22:26,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:22:26,740 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 21 treesize of output 24 [2019-01-11 11:22:26,743 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 24 treesize of output 26 [2019-01-11 11:22:26,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,748 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 26 treesize of output 36 [2019-01-11 11:22:26,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,757 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 28 treesize of output 50 [2019-01-11 11:22:26,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:22:26,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:22:26,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:26,817 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:26,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:26,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:26,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:26,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:22:26,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,928 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 53 treesize of output 63 [2019-01-11 11:22:26,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:26,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:22:27,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:22:27,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:22:27,093 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:27,119 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:27,143 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:27,168 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:27,195 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:27,240 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-11 11:22:27,240 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:22:27,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:22:27,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:22:27,424 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-11 11:22:27,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 11:22:27,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:27,507 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:27,507 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-11 11:22:27,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:27,539 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-11 11:22:27,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-01-11 11:22:27,560 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-11 11:22:27,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:22:27,578 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-11 11:22:27,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:22:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:22:27,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:22:27,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:22:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:22:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:22:27,597 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-01-11 11:22:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:22:37,581 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-01-11 11:22:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:22:37,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:22:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:22:37,614 INFO L225 Difference]: With dead ends: 9947 [2019-01-11 11:22:37,615 INFO L226 Difference]: Without dead ends: 9946 [2019-01-11 11:22:37,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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-11 11:22:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-01-11 11:22:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-01-11 11:22:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-11 11:22:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-11 11:22:48,487 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-11 11:22:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:22:48,487 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-11 11:22:48,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:22:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-11 11:22:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:22:48,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:22:48,495 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:22:48,495 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:22:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:22:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-01-11 11:22:48,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:22:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:22:48,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:22:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:22:48,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:22:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:22:48,562 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-11 11:22:48,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:22:48,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:22:48,562 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:22:48,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:22:48,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:22:48,562 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:22:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:22:48,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:22:48,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:22:48,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:22:48,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:22:48,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 24 [2019-01-11 11:22:48,603 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 24 treesize of output 30 [2019-01-11 11:22:48,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,608 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 26 treesize of output 40 [2019-01-11 11:22:48,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,613 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 28 treesize of output 54 [2019-01-11 11:22:48,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:22:48,633 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 32 treesize of output 71 [2019-01-11 11:22:48,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,682 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,757 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-11 11:22:48,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,790 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-11 11:22:48,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,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, 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-11 11:22:48,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:48,880 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-11 11:22:48,881 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,898 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,914 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,930 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:48,964 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-11 11:22:48,964 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:22:49,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:22:49,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:22:49,182 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-11 11:22:49,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-01-11 11:22:49,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,293 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:49,294 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 60 treesize of output 72 [2019-01-11 11:22:49,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:49,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-11 11:22:49,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-11 11:22:49,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-01-11 11:22:49,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-01-11 11:22:49,895 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-01-11 11:22:49,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:49,912 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:49,913 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 93 [2019-01-11 11:22:49,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:50,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,063 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 50 treesize of output 98 [2019-01-11 11:22:50,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:50,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,211 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:50,212 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 113 [2019-01-11 11:22:50,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:50,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,343 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 76 treesize of output 66 [2019-01-11 11:22:50,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:50,425 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-11 11:22:50,425 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-01-11 11:22:50,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,511 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 78 [2019-01-11 11:22:50,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:50,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,635 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 50 treesize of output 98 [2019-01-11 11:22:50,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:50,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,778 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 108 [2019-01-11 11:22:50,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:50,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:50,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, 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 100 [2019-01-11 11:22:50,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:51,013 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-11 11:22:51,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-01-11 11:22:51,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,124 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:51,125 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 44 treesize of output 123 [2019-01-11 11:22:51,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:51,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,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, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 118 [2019-01-11 11:22:51,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:51,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,408 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:51,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,410 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 44 treesize of output 125 [2019-01-11 11:22:51,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:51,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:51,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-11 11:22:51,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:51,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-11 11:22:51,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-01-11 11:22:51,717 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-11 11:22:51,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:22:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:22:51,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:22:51,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 11:22:51,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:22:51,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:22:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:22:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:22:51,883 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-01-11 11:22:52,085 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-11 11:22:52,359 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-01-11 11:22:52,661 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-01-11 11:22:53,208 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-01-11 11:22:53,963 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-01-11 11:22:55,458 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-01-11 11:23:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:23:07,558 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-01-11 11:23:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:23:07,559 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:23:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:23:07,601 INFO L225 Difference]: With dead ends: 12394 [2019-01-11 11:23:07,602 INFO L226 Difference]: Without dead ends: 12392 [2019-01-11 11:23:07,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-01-11 11:23:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-01-11 11:23:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-01-11 11:23:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-01-11 11:23:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-01-11 11:23:16,940 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-01-11 11:23:16,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:23:16,940 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-01-11 11:23:16,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:23:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-01-11 11:23:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:23:16,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:23:16,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:23:16,949 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:23:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-01-11 11:23:16,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:23:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:16,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:23:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:16,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:23:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:23:17,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:17,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:23:17,039 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:23:17,039 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-01-11 11:23:17,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:23:17,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:23:17,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:23:17,042 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:23:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:17,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:23:17,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:17,043 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:23:17,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:23:17,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:23:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:17,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:23:17,060 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 21 treesize of output 24 [2019-01-11 11:23:17,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 24 treesize of output 26 [2019-01-11 11:23:17,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,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 26 treesize of output 36 [2019-01-11 11:23:17,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,079 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 28 treesize of output 50 [2019-01-11 11:23:17,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:23:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:23:17,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,136 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,157 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:23:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:23:17,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:23:17,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,348 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:23:17,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:23:17,417 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,441 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,465 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,488 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,559 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-11 11:23:17,559 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:23:17,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:23:17,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:23:17,752 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-11 11:23:17,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-11 11:23:17,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 90 [2019-01-11 11:23:17,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:17,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:17,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 127 [2019-01-11 11:23:17,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:18,025 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-11 11:23:18,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-01-11 11:23:18,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,080 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:18,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-11 11:23:18,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:18,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,171 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:18,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:18,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 138 [2019-01-11 11:23:18,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:18,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 11:23:18,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-01-11 11:23:18,358 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-11 11:23:18,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:23:18,396 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-11 11:23:18,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:23:18,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:23:18,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:23:18,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:23:18,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:23:18,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:23:18,415 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-01-11 11:23:18,599 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-11 11:23:20,261 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-01-11 11:23:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:23:28,310 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-01-11 11:23:28,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:23:28,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:23:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:23:28,334 INFO L225 Difference]: With dead ends: 7367 [2019-01-11 11:23:28,334 INFO L226 Difference]: Without dead ends: 7366 [2019-01-11 11:23:28,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:23:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-01-11 11:23:37,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-01-11 11:23:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-01-11 11:23:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-01-11 11:23:37,908 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-01-11 11:23:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:23:37,908 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-01-11 11:23:37,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:23:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-01-11 11:23:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:23:37,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:23:37,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:23:37,914 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:23:37,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:37,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-01-11 11:23:37,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:23:37,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:37,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:23:37,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:37,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:23:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:38,064 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-11 11:23:38,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:38,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:23:38,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:23:38,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:23:38,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:38,065 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:23:38,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:23:38,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:23:38,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:23:38,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:23:38,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:23:38,104 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 21 treesize of output 24 [2019-01-11 11:23:38,107 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 24 treesize of output 30 [2019-01-11 11:23:38,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,113 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 26 treesize of output 40 [2019-01-11 11:23:38,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,119 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 28 treesize of output 54 [2019-01-11 11:23:38,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,127 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:23:38,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:23:38,137 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,177 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,277 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 68 treesize of output 71 [2019-01-11 11:23:38,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,316 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 58 treesize of output 67 [2019-01-11 11:23:38,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,359 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 46 treesize of output 72 [2019-01-11 11:23:38,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,415 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:23:38,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:23:38,494 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,521 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,547 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,574 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,601 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,648 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-11 11:23:38,648 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:23:38,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:23:38,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:23:38,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:23:38,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:23:38,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,827 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-11 11:23:38,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:23:38,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,870 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:38,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:23:38,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:38,919 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-11 11:23:38,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 11:23:38,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:38,963 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:38,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:23:38,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:39,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:23:39,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-11 11:23:39,040 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-11 11:23:39,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:23:39,089 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-11 11:23:39,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:23:39,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:23:39,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:23:39,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:23:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:23:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:23:39,107 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-01-11 11:23:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:23:55,580 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-01-11 11:23:55,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:23:55,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:23:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:23:55,613 INFO L225 Difference]: With dead ends: 9936 [2019-01-11 11:23:55,613 INFO L226 Difference]: Without dead ends: 9935 [2019-01-11 11:23:55,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:23:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-01-11 11:24:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-01-11 11:24:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-01-11 11:24:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-01-11 11:24:09,935 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-01-11 11:24:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:24:09,935 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-01-11 11:24:09,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:24:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-01-11 11:24:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:24:09,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:24:09,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:24:09,942 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:24:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:24:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-01-11 11:24:09,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:24:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:24:09,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:24:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:24:09,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:24:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:24:10,049 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-11 11:24:10,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:24:10,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:24:10,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:24:10,050 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-01-11 11:24:10,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:24:10,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:24:10,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:24:10,052 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:24:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:24:10,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:24:10,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:24:10,053 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:24:10,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:24:10,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:24:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:24:10,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:24:10,070 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 63 treesize of output 56 [2019-01-11 11:24:10,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,088 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 53 treesize of output 63 [2019-01-11 11:24:10,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,130 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 46 treesize of output 68 [2019-01-11 11:24:10,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:24:10,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:24:10,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,269 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,371 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 21 treesize of output 24 [2019-01-11 11:24:10,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:24:10,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:24:10,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:24:10,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:24:10,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:24:10,389 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,419 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,437 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,450 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,461 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,473 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,513 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-11 11:24:10,513 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:24:10,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:24:10,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:24:10,686 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-11 11:24:10,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 11:24:10,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,736 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:24:10,736 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-11 11:24:10,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,763 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-11 11:24:10,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-11 11:24:10,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:10,791 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-11 11:24:10,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:24:10,822 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-11 11:24:10,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-11 11:24:10,844 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-11 11:24:10,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:24:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:24:10,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:24:10,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:24:10,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:24:10,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:24:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:24:10,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:24:10,890 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-01-11 11:24:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:24:25,258 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-01-11 11:24:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:24:25,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:24:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:24:25,289 INFO L225 Difference]: With dead ends: 9235 [2019-01-11 11:24:25,289 INFO L226 Difference]: Without dead ends: 9232 [2019-01-11 11:24:25,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:24:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-01-11 11:24:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-01-11 11:24:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-01-11 11:24:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-01-11 11:24:40,274 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-01-11 11:24:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:24:40,274 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-01-11 11:24:40,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:24:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-01-11 11:24:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:24:40,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:24:40,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:24:40,281 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:24:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:24:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-01-11 11:24:40,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:24:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:24:40,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:24:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:24:40,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:24:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:24:40,346 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-11 11:24:40,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:24:40,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:24:40,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:24:40,347 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-01-11 11:24:40,347 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:24:40,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:24:40,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:24:40,349 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:24:40,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:24:40,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:24:40,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:24:40,350 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:24:40,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:24:40,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:24:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:24:40,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:24:40,382 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-11 11:24:40,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:24:40,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,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, 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-11 11:24:40,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:24:40,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:24:40,554 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 24 treesize of output 26 [2019-01-11 11:24:40,558 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 26 treesize of output 36 [2019-01-11 11:24:40,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:24:40,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:24:40,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:24:40,573 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,597 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,614 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,628 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,639 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,650 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,678 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-11 11:24:40,679 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:24:40,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,728 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-11 11:24:40,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:24:40,817 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-11 11:24:40,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 11:24:40,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:24:40,860 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:24:40,861 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-11 11:24:40,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:24:40,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-11 11:24:40,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-01-11 11:24:40,898 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-11 11:24:40,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:24:40,917 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-11 11:24:40,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:24:40,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:24:40,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:24:40,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:24:40,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:24:40,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:24:40,936 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-01-11 11:24:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:24:54,687 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-01-11 11:24:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:24:54,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:24:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:24:54,716 INFO L225 Difference]: With dead ends: 9065 [2019-01-11 11:24:54,716 INFO L226 Difference]: Without dead ends: 9064 [2019-01-11 11:24:54,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:24:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-01-11 11:25:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-01-11 11:25:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-01-11 11:25:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-01-11 11:25:09,700 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-01-11 11:25:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:25:09,700 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-01-11 11:25:09,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:25:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-01-11 11:25:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:25:09,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:25:09,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:25:09,708 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:25:09,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:25:09,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-01-11 11:25:09,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:25:09,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:25:09,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:25:09,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:25:09,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:25:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:25:09,785 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-11 11:25:09,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:25:09,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:25:09,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:25:09,785 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-01-11 11:25:09,786 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:25:09,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:25:09,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:25:09,787 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:25:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:25:09,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:25:09,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:25:09,788 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:25:09,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:25:09,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:25:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:25:09,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:25:09,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,826 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 68 treesize of output 71 [2019-01-11 11:25:09,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,865 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 58 treesize of output 67 [2019-01-11 11:25:09,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:25:09,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:09,969 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:25:10,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:25:10,039 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,068 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-01-11 11:25:10,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:25:10,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:25:10,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:25:10,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:25:10,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:25:10,212 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,246 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,264 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,279 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,291 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,302 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,345 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-01-11 11:25:10,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:25:10,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,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-11 11:25:10,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-01-11 11:25:10,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:25:10,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,574 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-11 11:25:10,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-01-11 11:25:10,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,621 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:25:10,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:25:10,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,670 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-11 11:25:10,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-01-11 11:25:10,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,715 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:25:10,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-11 11:25:10,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,764 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-11 11:25:10,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-01-11 11:25:10,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:10,809 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:25:10,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 127 [2019-01-11 11:25:10,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:10,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:25:10,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-01-11 11:25:10,887 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-11 11:25:10,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:25:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:25:11,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:25:11,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:25:11,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:25:11,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:25:11,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:25:11,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:25:11,005 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-01-11 11:25:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:25:32,346 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-01-11 11:25:32,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:25:32,346 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 11:25:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:25:32,377 INFO L225 Difference]: With dead ends: 9411 [2019-01-11 11:25:32,378 INFO L226 Difference]: Without dead ends: 9409 [2019-01-11 11:25:32,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-01-11 11:25:32,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-01-11 11:25:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-01-11 11:25:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-01-11 11:25:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-01-11 11:25:46,956 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-01-11 11:25:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:25:46,956 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-01-11 11:25:46,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:25:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-01-11 11:25:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:25:46,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:25:46,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:25:46,964 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:25:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:25:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-01-11 11:25:46,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:25:46,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:25:46,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:25:46,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:25:46,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:25:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:25:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:25:47,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:25:47,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:25:47,102 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:25:47,102 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-01-11 11:25:47,103 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:25:47,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:25:47,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:25:47,105 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:25:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:25:47,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:25:47,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:25:47,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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:25:47,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:25:47,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:25:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:25:47,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:25:47,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,153 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 68 treesize of output 71 [2019-01-11 11:25:47,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,192 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 58 treesize of output 67 [2019-01-11 11:25:47,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,236 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 46 treesize of output 72 [2019-01-11 11:25:47,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,288 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:25:47,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:25:47,357 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,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, 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 24 [2019-01-11 11:25:47,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:25:47,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:25:47,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:25:47,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:25:47,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:25:47,508 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,541 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,561 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,576 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,588 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,599 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,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-11 11:25:47,643 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:25:47,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:25:47,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,730 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-11 11:25:47,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:25:47,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,774 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:25:47,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:25:47,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,819 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-11 11:25:47,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-01-11 11:25:47,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:25:47,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,908 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-11 11:25:47,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-01-11 11:25:47,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:47,950 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:25:47,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-11 11:25:47,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:47,999 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-11 11:25:48,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-01-11 11:25:48,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,041 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:25:48,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:25:48,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-11 11:25:48,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:25:48,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:25:48,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:49 [2019-01-11 11:25:48,117 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-11 11:25:48,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:25:48,199 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-11 11:25:48,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:25:48,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:25:48,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:25:48,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:25:48,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:25:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:25:48,218 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-01-11 11:26:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:26:03,842 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-01-11 11:26:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:26:03,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 11:26:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:26:03,871 INFO L225 Difference]: With dead ends: 8797 [2019-01-11 11:26:03,871 INFO L226 Difference]: Without dead ends: 8791 [2019-01-11 11:26:03,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:26:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-01-11 11:26:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-01-11 11:26:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-01-11 11:26:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-01-11 11:26:12,090 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-01-11 11:26:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:26:12,090 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-01-11 11:26:12,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:26:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-01-11 11:26:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:26:12,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:26:12,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:26:12,093 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:26:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:26:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-01-11 11:26:12,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:26:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:26:12,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:26:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:26:12,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:26:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:26:12,161 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-11 11:26:12,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:26:12,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:26:12,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:26:12,161 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-01-11 11:26:12,162 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:26:12,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:26:12,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:26:12,164 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:26:12,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:26:12,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:26:12,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:26:12,165 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:26:12,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:26:12,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:26:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:26:12,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:26:12,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 63 treesize of output 56 [2019-01-11 11:26:12,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,201 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 53 treesize of output 63 [2019-01-11 11:26:12,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:26:12,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,292 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:26:12,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:26:12,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,431 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,497 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 21 treesize of output 24 [2019-01-11 11:26:12,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:26:12,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:26:12,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:26:12,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:26:12,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:26:12,514 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,546 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,564 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,577 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,589 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,600 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,640 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-11 11:26:12,641 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:26:12,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:26:12,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,713 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-11 11:26:12,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:26:12,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-11 11:26:12,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:12,791 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-11 11:26:12,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-11 11:26:12,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:12,830 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:26:12,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 134 [2019-01-11 11:26:12,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:26:12,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 11:26:12,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:90 [2019-01-11 11:26:13,036 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-11 11:26:13,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:26:13,073 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-11 11:26:13,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:26:13,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:26:13,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:26:13,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:26:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:26:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:26:13,092 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-01-11 11:26:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:26:22,940 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-01-11 11:26:22,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:26:22,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:26:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:26:22,946 INFO L225 Difference]: With dead ends: 1963 [2019-01-11 11:26:22,946 INFO L226 Difference]: Without dead ends: 1962 [2019-01-11 11:26:22,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:26:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-01-11 11:26:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1925. [2019-01-11 11:26:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-01-11 11:26:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 13247 transitions. [2019-01-11 11:26:31,011 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 13247 transitions. Word has length 7 [2019-01-11 11:26:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:26:31,011 INFO L480 AbstractCegarLoop]: Abstraction has 1925 states and 13247 transitions. [2019-01-11 11:26:31,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:26:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 13247 transitions. [2019-01-11 11:26:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:26:31,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:26:31,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:26:31,015 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:26:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:26:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-01-11 11:26:31,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:26:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:26:31,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:26:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:26:31,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:26:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:26:31,109 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-11 11:26:31,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:26:31,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:26:31,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:26:31,110 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [30], [31] [2019-01-11 11:26:31,110 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:26:31,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:26:31,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:26:31,112 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:26:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:26:31,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:26:31,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:26:31,112 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:26:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:26:31,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:26:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:26:31,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:26:31,130 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 21 treesize of output 24 [2019-01-11 11:26:31,133 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 24 treesize of output 26 [2019-01-11 11:26:31,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,137 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 26 treesize of output 36 [2019-01-11 11:26:31,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,144 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 28 treesize of output 50 [2019-01-11 11:26:31,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:26:31,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:26:31,165 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,190 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:26:31,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,287 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-11 11:26:31,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,320 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-11 11:26:31,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,364 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-11 11:26:31,364 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,379 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,392 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,436 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-11 11:26:31,436 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 11:26:31,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,482 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-11 11:26:31,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,500 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-11 11:26:31,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:26:31,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 11:26:31,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,547 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-11 11:26:31,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 11:26:31,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:31,575 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:26:31,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 11:26:31,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:31,598 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-11 11:26:31,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:26:31,617 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-11 11:26:31,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:26:31,657 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-11 11:26:31,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:26:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-01-11 11:26:31,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:26:31,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:26:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:26:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:26:31,676 INFO L87 Difference]: Start difference. First operand 1925 states and 13247 transitions. Second operand 11 states. [2019-01-11 11:26:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:26:39,614 INFO L93 Difference]: Finished difference Result 2000 states and 13456 transitions. [2019-01-11 11:26:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:26:39,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:26:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:26:39,619 INFO L225 Difference]: With dead ends: 2000 [2019-01-11 11:26:39,620 INFO L226 Difference]: Without dead ends: 1999 [2019-01-11 11:26:39,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:26:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-01-11 11:26:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1945. [2019-01-11 11:26:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2019-01-11 11:26:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 13387 transitions. [2019-01-11 11:26:47,825 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 13387 transitions. Word has length 7 [2019-01-11 11:26:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:26:47,826 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 13387 transitions. [2019-01-11 11:26:47,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:26:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 13387 transitions. [2019-01-11 11:26:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:26:47,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:26:47,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:26:47,828 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:26:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:26:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1895531480, now seen corresponding path program 1 times [2019-01-11 11:26:47,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:26:47,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:26:47,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:26:47,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:26:47,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:26:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:26:47,852 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-11 11:26:47,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:26:47,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:26:47,852 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:26:47,853 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [30], [32], [34], [35] [2019-01-11 11:26:47,853 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:26:47,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:26:47,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:26:47,855 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:26:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:26:47,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:26:47,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:26:47,855 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:26:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:26:47,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:26:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:26:47,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:26:47,871 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 21 treesize of output 24 [2019-01-11 11:26:47,872 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 24 treesize of output 26 [2019-01-11 11:26:47,877 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 26 treesize of output 28 [2019-01-11 11:26:47,889 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 28 treesize of output 30 [2019-01-11 11:26:47,901 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-01-11 11:26:47,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-11 11:26:47,921 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:47,932 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:47,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:47,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:47,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:47,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:47,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:26:47,986 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:21, output treesize:31 [2019-01-11 11:26:47,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:26:47,991 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-11 11:26:47,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:26:47,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:26:47,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 11:26:47,995 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-11 11:26:47,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:26:47,999 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-11 11:26:48,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:26:48,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-11 11:26:48,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:26:48,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:26:48,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:26:48,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:26:48,018 INFO L87 Difference]: Start difference. First operand 1945 states and 13387 transitions. Second operand 4 states. [2019-01-11 11:26:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:26:59,298 INFO L93 Difference]: Finished difference Result 3175 states and 21705 transitions. [2019-01-11 11:26:59,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:26:59,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-11 11:26:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:26:59,307 INFO L225 Difference]: With dead ends: 3175 [2019-01-11 11:26:59,307 INFO L226 Difference]: Without dead ends: 3170 [2019-01-11 11:26:59,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:26:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-01-11 11:27:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3133. [2019-01-11 11:27:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-01-11 11:27:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-01-11 11:27:11,857 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-01-11 11:27:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:11,857 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-01-11 11:27:11,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:27:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-01-11 11:27:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:27:11,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:11,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:27:11,861 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1908522342, now seen corresponding path program 1 times [2019-01-11 11:27:11,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:11,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:11,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:11,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:11,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:11,905 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-11 11:27:11,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:11,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:11,905 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:27:11,905 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [30], [32], [33] [2019-01-11 11:27:11,906 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:27:11,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:27:11,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:27:11,907 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:27:11,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:11,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:27:11,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:11,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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:11,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:11,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:11,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:11,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 21 treesize of output 24 [2019-01-11 11:27:11,927 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 24 treesize of output 26 [2019-01-11 11:27:11,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,932 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 26 treesize of output 36 [2019-01-11 11:27:11,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,942 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 28 treesize of output 50 [2019-01-11 11:27:11,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:11,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:27:11,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:27:11,963 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:11,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,070 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-11 11:27:12,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,086 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-11 11:27:12,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,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-11 11:27:12,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,162 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-11 11:27:12,162 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,176 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,190 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,205 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,234 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-11 11:27:12,234 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:27:12,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,270 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-11 11:27:12,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,288 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-11 11:27:12,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:27:12,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:27:12,311 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:27:12,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, 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-11 11:27:12,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:12,332 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-11 11:27:12,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 11:27:12,347 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-11 11:27:12,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:12,367 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-11 11:27:12,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:12,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:27:12,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:12,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:27:12,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:27:12,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:27:12,385 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states.