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-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:22:38,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:22:38,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:22:38,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:22:38,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:22:38,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:22:38,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:22:38,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:22:38,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:22:38,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:22:38,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:22:38,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:22:38,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:22:38,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:22:38,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:22:38,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:22:38,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:22:38,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:22:38,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:22:38,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:22:38,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:22:38,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:22:38,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:22:38,476 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:22:38,476 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:22:38,477 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:22:38,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:22:38,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:22:38,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:22:38,481 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:22:38,481 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:22:38,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:22:38,482 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:22:38,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:22:38,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:22:38,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:22:38,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:22:38,497 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:22:38,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:22:38,498 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:22:38,499 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:22:38,499 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:22:38,499 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:22:38,499 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:22:38,499 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:22:38,500 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:22:38,500 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:22:38,500 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:22:38,500 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:22:38,500 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:22:38,501 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:22:38,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:22:38,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:22:38,502 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:22:38,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:22:38,502 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:22:38,502 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:22:38,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:22:38,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:22:38,503 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:22:38,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:22:38,503 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:22:38,504 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:22:38,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:22:38,504 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:22:38,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:22:38,504 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:22:38,505 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:22:38,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:22:38,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:22:38,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:22:38,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:22:38,508 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:22:38,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:22:38,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:22:38,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:22:38,509 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:22:38,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:22:38,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:22:38,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:22:38,571 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:22:38,572 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:22:38,573 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-02-28 10:22:38,573 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-02-28 10:22:38,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:22:38,612 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:22:38,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:22:38,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:22:38,613 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:22:38,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:22:38,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:22:38,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:22:38,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:22:38,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... [2019-02-28 10:22:38,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:22:38,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:22:38,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:22:38,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:22:38,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:22:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:22:38,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:22:39,096 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:22:39,096 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-28 10:22:39,098 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:22:39 BoogieIcfgContainer [2019-02-28 10:22:39,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:22:39,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:22:39,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:22:39,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:22:39,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:22:38" (1/2) ... [2019-02-28 10:22:39,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b4f0a0 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:22:39, skipping insertion in model container [2019-02-28 10:22:39,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:22:39" (2/2) ... [2019-02-28 10:22:39,106 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-02-28 10:22:39,115 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:22:39,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-28 10:22:39,142 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-28 10:22:39,171 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:22:39,172 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:22:39,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:22:39,172 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:22:39,172 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:22:39,172 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:22:39,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:22:39,173 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:22:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-28 10:22:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:22:39,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:39,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:22:39,195 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-28 10:22:39,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:39,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:39,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:39,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:39,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:39,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:39,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:39,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:39,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:39,396 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-28 10:22:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:39,680 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-28 10:22:39,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:39,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:22:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:39,695 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:22:39,695 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:22:39,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:22:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-28 10:22:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:22:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-28 10:22:39,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-28 10:22:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:39,735 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-28 10:22:39,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-28 10:22:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:39,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:39,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:39,737 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-28 10:22:39,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:39,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:39,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:39,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:39,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:39,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:39,955 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-28 10:22:40,004 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:40,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:40,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:40,088 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:40,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:40,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:40,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:40,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:40,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:40,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:40,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:40,186 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:40,227 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,229 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:40,270 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,320 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,322 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:40,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,389 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,417 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,435 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:40,445 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,467 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,478 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,481 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,536 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:40,537 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,660 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,764 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,827 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,882 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,947 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:40,947 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:40,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,991 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,088 INFO L289 Elim1Store]: Index analysis took 101 ms [2019-02-28 10:22:41,092 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:41,093 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:41,159 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:41,163 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:41,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:41,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:41,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:41,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:41,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:41,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:41,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:41,254 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-28 10:22:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:41,914 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-28 10:22:41,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:41,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:22:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:41,916 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:22:41,916 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:22:41,917 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-02-28 10:22:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:22:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-28 10:22:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:22:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-28 10:22:41,933 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-28 10:22:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:41,933 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-28 10:22:41,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-28 10:22:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:41,935 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:41,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:41,936 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-28 10:22:41,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:41,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:41,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:41,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:41,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:42,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:42,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:42,086 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-28 10:22:42,088 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:42,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:42,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:42,096 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:42,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:42,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:42,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:42,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:42,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:42,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:42,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:42,127 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:42,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,134 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:42,148 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,153 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,154 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:42,180 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,195 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,198 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,201 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:42,208 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,210 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,215 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,217 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,225 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,226 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,226 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,228 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:42,229 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,247 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,260 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,270 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,281 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,303 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:42,304 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:42,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,335 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,348 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,348 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,351 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:42,352 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,375 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:42,375 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:22:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:42,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-28 10:22:42,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:42,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:42,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:42,462 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-28 10:22:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:42,517 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-28 10:22:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:42,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:22:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:42,520 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:22:42,521 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:22:42,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:22:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-28 10:22:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:22:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-28 10:22:42,526 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-28 10:22:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:42,526 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-28 10:22:42,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-28 10:22:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:42,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:42,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:42,527 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-28 10:22:42,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:42,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:42,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:42,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:42,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:42,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:42,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:42,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:42,561 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-28 10:22:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:42,608 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-28 10:22:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:42,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:22:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:42,609 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:22:42,609 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:22:42,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:22:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-28 10:22:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:22:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-28 10:22:42,616 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-28 10:22:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:42,616 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-28 10:22:42,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-28 10:22:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:42,617 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:42,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:42,618 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-28 10:22:42,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:42,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:42,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:42,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:42,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:42,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:42,734 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-28 10:22:42,737 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:42,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:42,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:42,750 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:42,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:42,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:42,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:42,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:42,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:42,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:42,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:42,772 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:42,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,786 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:42,792 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,797 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:42,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,815 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:42,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,836 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,837 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,838 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,845 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,850 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,854 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:42,854 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,881 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,891 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,926 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,936 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,962 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:42,963 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:42,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,051 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:43,052 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:43,089 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:43,090 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:43,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:43,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:43,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:43,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:43,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:43,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:43,144 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-28 10:22:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:43,416 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-28 10:22:43,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:43,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:22:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:43,422 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:22:43,422 INFO L226 Difference]: Without dead ends: 38 [2019-02-28 10:22:43,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-28 10:22:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-28 10:22:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 10:22:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-28 10:22:43,428 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-28 10:22:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:43,429 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-28 10:22:43,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-28 10:22:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:43,430 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:43,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:43,430 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-28 10:22:43,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:43,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:43,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:43,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:43,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:43,662 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 10:22:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:43,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:43,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:43,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:43,676 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-28 10:22:43,680 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:43,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:43,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:43,689 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:43,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:43,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:43,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:43,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:43,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:43,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:43,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:43,718 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:43,732 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,733 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:43,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,744 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:43,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,828 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,835 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:43,853 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,855 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,862 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,863 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,864 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,866 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:43,870 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:43,870 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:43,884 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:43,897 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:43,911 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:43,922 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:43,983 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:43,983 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:44,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,020 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,024 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:44,025 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:44,045 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:44,046 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:44,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,090 INFO L442 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 38 treesize of output 33 [2019-02-28 10:22:44,091 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:44,128 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:44,128 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:22:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:44,160 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:44,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:44,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:44,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:44,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:44,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:44,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:44,211 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-28 10:22:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:44,812 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-02-28 10:22:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:44,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:44,815 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:22:44,815 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:22:44,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:22:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-02-28 10:22:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:22:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-28 10:22:44,822 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-28 10:22:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:44,823 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-28 10:22:44,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-28 10:22:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:44,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:44,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:44,824 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-02-28 10:22:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:44,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:44,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:44,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:44,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:44,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:44,903 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:44,904 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-28 10:22:44,906 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:44,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:44,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:44,913 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:44,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:44,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:44,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:44,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:44,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:44,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:44,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:44,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:44,939 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:44,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,946 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:44,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,955 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:44,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,970 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:44,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,007 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:45,007 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,017 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,027 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,038 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,050 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,070 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:45,071 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:45,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,103 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,107 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,110 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:45,111 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,131 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:45,131 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:45,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,223 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,225 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,226 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,227 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,234 INFO L442 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 38 treesize of output 33 [2019-02-28 10:22:45,235 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,461 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:45,461 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:22:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:45,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:45,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:45,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:22:45,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:45,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:22:45,634 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-28 10:22:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:46,309 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-02-28 10:22:46,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:46,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:46,311 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:22:46,311 INFO L226 Difference]: Without dead ends: 46 [2019-02-28 10:22:46,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-28 10:22:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-02-28 10:22:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:22:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-02-28 10:22:46,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-02-28 10:22:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:46,321 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-02-28 10:22:46,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-02-28 10:22:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:46,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:46,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:46,322 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-28 10:22:46,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:46,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:46,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:46,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:46,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:46,405 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:46,406 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-28 10:22:46,407 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:46,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:46,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:46,417 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:46,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:46,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:46,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:46,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:46,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:46,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:46,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:46,438 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:46,489 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:22:46,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,507 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:22:46,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,528 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:22:46,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,536 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,537 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,566 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:22:46,567 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,577 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,587 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,597 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,608 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,626 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:46,626 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:22:46,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,666 INFO L442 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 31 treesize of output 26 [2019-02-28 10:22:46,667 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,684 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:46,685 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:46,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:46,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:46,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-28 10:22:46,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:46,798 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-02-28 10:22:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:46,870 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-02-28 10:22:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:46,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:22:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:46,871 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:22:46,872 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:22:46,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:22:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-28 10:22:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:22:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-02-28 10:22:46,880 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-02-28 10:22:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:46,880 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-02-28 10:22:46,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-02-28 10:22:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:46,881 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:46,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:46,881 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-28 10:22:46,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:46,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:46,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:47,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:47,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:47,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:47,005 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-28 10:22:47,006 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:47,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:47,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:47,013 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:47,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:47,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:47,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:47,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:47,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:47,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:47,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:47,038 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:47,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,043 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:47,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,051 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:47,059 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,061 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,064 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,072 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:47,082 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,126 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:47,126 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,140 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,150 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,160 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,171 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,191 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:47,191 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:47,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,235 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,237 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,241 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:47,242 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,264 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:47,265 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:47,293 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,294 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,296 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,296 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,298 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,301 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,302 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,303 INFO L442 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 38 treesize of output 33 [2019-02-28 10:22:47,304 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,323 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:47,323 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:22:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:47,351 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:47,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:47,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:47,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:47,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:47,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:47,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:47,400 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-02-28 10:22:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:47,875 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-02-28 10:22:47,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:47,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:47,877 INFO L225 Difference]: With dead ends: 44 [2019-02-28 10:22:47,877 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:22:47,877 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-02-28 10:22:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:22:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-02-28 10:22:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:22:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-02-28 10:22:47,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-02-28 10:22:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:47,885 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-02-28 10:22:47,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-02-28 10:22:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:47,886 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:47,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:47,886 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-28 10:22:47,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:47,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:47,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:47,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:47,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:47,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:47,944 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-28 10:22:47,945 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:47,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:47,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:47,950 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:47,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:47,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:47,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:47,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:47,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:47,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:47,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:47,968 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:47,988 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:22:47,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,012 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:22:48,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,029 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:22:48,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,055 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:22:48,056 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,065 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,077 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,088 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,097 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,114 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:48,114 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:22:48,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,141 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,142 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,142 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,144 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,146 INFO L442 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 31 treesize of output 26 [2019-02-28 10:22:48,146 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,159 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:48,160 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:48,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:48,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:48,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:48,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:48,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:48,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:48,202 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-02-28 10:22:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:48,503 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-02-28 10:22:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:48,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:22:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:48,504 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:22:48,504 INFO L226 Difference]: Without dead ends: 42 [2019-02-28 10:22:48,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-28 10:22:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-02-28 10:22:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:22:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-02-28 10:22:48,512 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-02-28 10:22:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:48,512 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-02-28 10:22:48,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-02-28 10:22:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:48,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:48,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:48,513 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:48,513 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-28 10:22:48,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:48,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:48,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:48,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:48,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:48,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:48,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:48,643 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-28 10:22:48,644 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:48,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:48,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:48,650 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:48,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:48,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:48,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:48,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:48,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:48,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:48,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:48,715 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:48,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,729 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:48,736 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,737 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,738 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:48,747 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,749 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,754 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,760 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,761 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:48,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,852 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,855 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:48,855 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,865 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,876 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,887 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,897 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,916 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:48,916 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:48,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,948 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:48,948 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,983 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:48,984 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:22:49,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,007 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,016 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:49,017 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,040 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:49,041 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:22: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-02-28 10:22:49,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:49,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:49,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:49,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:49,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:49,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:49,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:49,180 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-02-28 10:22:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:49,633 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-02-28 10:22:49,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:49,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:49,635 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:22:49,635 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:22:49,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:22:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-02-28 10:22:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:22:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-02-28 10:22:49,646 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-02-28 10:22:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:49,646 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-02-28 10:22:49,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-02-28 10:22:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:49,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:49,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:49,647 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-02-28 10:22:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:49,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:49,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:49,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:49,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:49,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:49,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:49,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:49,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:49,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:49,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:49,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:22:49,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:49,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:49,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:49,763 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:49,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,767 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:49,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,787 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,791 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:49,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,797 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,805 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:49,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,821 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:49,822 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,834 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,845 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,856 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,873 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,893 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:49,893 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:49,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,952 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:49,953 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,976 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:49,976 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:22:49,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,000 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,003 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,006 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:50,007 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,030 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:50,030 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:50,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:50,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:50,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:22:50,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:50,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:50,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:22:50,140 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-02-28 10:22:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:50,489 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-02-28 10:22:50,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:22:50,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:50,491 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:22:50,491 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:22:50,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:22:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-02-28 10:22:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:22:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-02-28 10:22:50,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-02-28 10:22:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:50,501 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-02-28 10:22:50,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-02-28 10:22:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:50,502 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:50,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:50,502 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-28 10:22:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:50,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:50,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:50,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:50,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:50,564 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:50,564 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-02-28 10:22:50,566 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:50,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:50,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:50,571 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:50,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:50,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:50,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:50,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:50,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:50,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:50,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:50,597 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:50,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,604 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:50,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,613 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:50,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,624 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:50,627 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,640 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:50,641 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,651 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,661 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,672 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,682 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,701 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:50,701 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:50,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,721 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,725 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,730 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:50,730 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,750 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:50,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:22:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:50,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:50,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:50,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:50,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:50,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:50,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:50,804 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-02-28 10:22:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:50,992 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-02-28 10:22:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:50,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:22:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:50,994 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:22:50,994 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:22:50,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:22:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-02-28 10:22:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:22:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-02-28 10:22:51,004 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-02-28 10:22:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:51,004 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-02-28 10:22:51,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-02-28 10:22:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:51,005 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:51,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:51,005 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-02-28 10:22:51,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:51,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:51,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:51,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:51,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:51,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:51,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:51,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:51,061 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-02-28 10:22:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:51,082 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-02-28 10:22:51,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:51,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:22:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:51,083 INFO L225 Difference]: With dead ends: 34 [2019-02-28 10:22:51,083 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:22:51,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:22:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-28 10:22:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:22:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-02-28 10:22:51,092 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-02-28 10:22:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:51,092 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-02-28 10:22:51,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-02-28 10:22:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:51,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:51,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:51,094 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:51,094 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-28 10:22:51,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:51,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:51,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:51,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:51,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:51,281 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-28 10:22:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:51,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:51,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:51,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:51,289 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-28 10:22:51,290 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:51,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:51,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:51,294 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:51,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:51,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:51,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:51,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:51,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:51,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:51,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:51,316 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:51,319 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,320 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:51,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,329 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,331 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,331 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:51,341 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,343 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,351 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,353 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,354 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:51,359 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,365 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,377 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,378 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:51,378 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,391 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,403 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,416 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,428 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,454 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:51,455 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:51,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,499 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,505 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,507 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,516 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:51,517 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,544 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:51,545 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:51,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,614 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,616 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,624 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,626 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,629 INFO L442 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 38 treesize of output 33 [2019-02-28 10:22:51,629 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,655 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:51,656 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:22:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:51,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:51,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:51,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:22:51,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:51,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:51,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:51,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:22:51,714 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-02-28 10:22:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:52,022 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-02-28 10:22:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:52,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:52,023 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:22:52,024 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:22:52,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:22:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-02-28 10:22:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:22:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-02-28 10:22:52,034 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-02-28 10:22:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:52,034 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-02-28 10:22:52,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-02-28 10:22:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:52,035 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:52,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:52,036 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:52,036 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-28 10:22:52,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:52,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:52,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:52,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:52,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:52,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:52,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:52,123 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:52,124 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-28 10:22:52,124 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:52,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:52,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:52,133 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:52,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:52,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:52,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:52,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:52,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:52,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:52,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:52,177 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:52,218 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:22:52,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,227 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:22:52,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,241 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:22:52,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,251 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,253 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,263 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:22:52,264 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,271 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,282 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,292 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,302 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,319 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:52,319 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:22:52,353 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,356 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,358 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,359 INFO L442 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 31 treesize of output 26 [2019-02-28 10:22:52,360 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,375 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:52,375 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:52,392 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:52,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:52,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:52,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:52,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:52,649 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-02-28 10:22:53,112 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-02-28 10:22:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:53,212 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-02-28 10:22:53,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:53,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:22:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:53,213 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:22:53,214 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:22:53,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:22:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-28 10:22:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:22:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-02-28 10:22:53,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-02-28 10:22:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:53,226 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-02-28 10:22:53,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-02-28 10:22:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:53,227 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:53,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:53,227 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:53,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:53,227 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-28 10:22:53,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:53,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:53,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:53,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:53,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:53,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:53,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:53,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:53,383 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-28 10:22:53,384 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:53,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:53,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:53,389 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:53,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:53,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:53,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:53,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:53,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:53,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:53,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:53,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:53,415 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:53,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,428 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:53,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,433 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:53,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,438 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,439 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,440 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,441 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,442 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:53,445 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,447 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,448 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,459 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,464 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,466 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,475 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:53,476 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,489 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,503 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,513 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,522 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,541 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:53,541 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:53,567 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,567 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,568 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,569 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,572 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,576 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:53,577 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,596 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:53,596 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:22:53,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,639 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:53,639 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,656 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:53,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:53,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:53,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:53,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:53,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:53,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:53,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:53,730 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-02-28 10:22:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:54,187 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-02-28 10:22:54,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:54,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:54,189 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:22:54,189 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:22:54,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:22:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-02-28 10:22:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:22:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-28 10:22:54,199 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-02-28 10:22:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:54,200 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-28 10:22:54,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-28 10:22:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:54,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:54,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:54,201 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:54,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-28 10:22:54,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:54,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:54,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:54,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:54,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:54,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:54,293 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-28 10:22:54,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:54,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:54,299 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:54,299 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:54,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:54,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:54,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:54,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:54,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:54,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:54,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:54,322 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:54,335 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:22:54,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,347 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:22:54,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,350 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,351 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,362 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:22:54,376 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,379 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,382 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,400 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:22:54,401 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:54,412 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:54,421 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:54,431 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:54,441 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:54,458 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:54,458 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:22:54,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,497 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,498 INFO L442 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 31 treesize of output 26 [2019-02-28 10:22:54,499 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:54,513 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:54,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:54,566 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,572 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:54,575 INFO L442 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 33 treesize of output 28 [2019-02-28 10:22:54,576 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:54,592 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:54,593 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:54,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:54,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:54,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:54,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:54,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:54,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:54,656 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-02-28 10:22:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:54,976 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-02-28 10:22:54,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:54,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:54,978 INFO L225 Difference]: With dead ends: 57 [2019-02-28 10:22:54,978 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:22:54,979 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-02-28 10:22:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:22:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-02-28 10:22:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:22:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-02-28 10:22:54,989 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-02-28 10:22:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:54,989 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-02-28 10:22:54,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-02-28 10:22:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:54,990 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:54,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:54,991 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-28 10:22:54,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:54,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:55,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:55,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:55,127 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:55,128 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-28 10:22:55,128 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:55,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:55,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:55,133 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:55,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:55,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:55,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:55,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:55,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:55,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:55,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:22:55,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:55,155 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:55,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,158 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:55,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,163 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,165 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,165 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:55,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,176 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,178 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,178 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,179 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,180 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:55,184 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,185 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,203 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,205 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:55,205 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,229 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,239 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,248 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,257 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,276 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:55,276 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:55,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,359 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,381 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,402 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,450 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,498 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,551 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,551 INFO L289 Elim1Store]: Index analysis took 235 ms [2019-02-28 10:22:55,552 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:55,553 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,615 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:55,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:55,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,668 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,670 INFO L442 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 38 treesize of output 33 [2019-02-28 10:22:55,671 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,690 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:55,690 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:22:55,716 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,717 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,717 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,718 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,721 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,725 INFO L442 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 38 treesize of output 33 [2019-02-28 10:22:55,726 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,742 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:55,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:22:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:55,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:55,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:55,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:22:55,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:55,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:55,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:55,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:22:55,853 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-02-28 10:22:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:56,935 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-02-28 10:22:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:56,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:22:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:56,937 INFO L225 Difference]: With dead ends: 68 [2019-02-28 10:22:56,937 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:22:56,937 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-02-28 10:22:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:22:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-02-28 10:22:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:22:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-28 10:22:56,951 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-02-28 10:22:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:56,951 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-28 10:22:56,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-28 10:22:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:56,952 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:56,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:56,952 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-28 10:22:56,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:56,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:57,121 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-28 10:22:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:57,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:57,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:57,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:57,156 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-28 10:22:57,158 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:57,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:57,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:57,162 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:57,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:57,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:57,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:57,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:57,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:57,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:57,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:57,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:57,195 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:57,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,200 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:57,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,209 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,210 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:57,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,223 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,224 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:57,227 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,228 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,234 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,235 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,237 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,238 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:57,238 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,263 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,272 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,283 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,293 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,312 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:57,312 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:57,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,340 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,341 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,344 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,348 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:57,348 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,367 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:57,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:57,389 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,390 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,391 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,392 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,393 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,395 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,396 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,397 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,398 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,399 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,402 INFO L442 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 38 treesize of output 33 [2019-02-28 10:22:57,402 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,426 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:57,426 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:22:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:57,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:57,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:57,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:57,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:57,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:57,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:57,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:57,487 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-02-28 10:22:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:57,848 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-02-28 10:22:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:57,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:57,849 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:22:57,849 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:22:57,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:22:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-02-28 10:22:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:22:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-02-28 10:22:57,860 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-02-28 10:22:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:57,861 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-02-28 10:22:57,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-02-28 10:22:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:57,861 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:57,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:57,862 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-02-28 10:22:57,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:57,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:57,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:57,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:57,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:57,906 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:57,906 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-28 10:22:57,907 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:57,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:57,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:57,913 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:57,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:57,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:57,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:57,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:57,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:57,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:57,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:57,935 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:57,949 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:22:57,979 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:22:58,023 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,072 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:22:58,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,096 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:22:58,097 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,105 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,115 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,125 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,135 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,149 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:58,149 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-28 10:22:58,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,176 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,177 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:22:58,177 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,185 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:58,186 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:58,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:58,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:58,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:58,228 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-02-28 10:22:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:58,354 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-02-28 10:22:58,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:58,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-28 10:22:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:58,356 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:22:58,356 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:22:58,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:22:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-02-28 10:22:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:22:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-02-28 10:22:58,367 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-02-28 10:22:58,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:58,367 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-02-28 10:22:58,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-02-28 10:22:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:58,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:58,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:58,368 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-02-28 10:22:58,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:58,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:58,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:58,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:58,457 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-02-28 10:22:58,458 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:58,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:58,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:58,462 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:58,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:58,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:58,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:58,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:58,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:58,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:22:58,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:58,482 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:58,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,484 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:58,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,496 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:58,499 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,503 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,505 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,506 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,507 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,508 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:22:58,515 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,515 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,578 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:22:58,578 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,588 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,598 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,608 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,618 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,637 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:58,638 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:22:58,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,764 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,767 INFO L442 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 36 treesize of output 31 [2019-02-28 10:22:58,768 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,786 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:58,786 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:22:58,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,822 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,826 INFO L442 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 38 treesize of output 33 [2019-02-28 10:22:58,826 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,845 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:58,846 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:22:58,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,884 INFO L442 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 40 treesize of output 35 [2019-02-28 10:22:58,884 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,903 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:58,903 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:22:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:58,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:22:58,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:58,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:58,991 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-02-28 10:22:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:59,581 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-02-28 10:22:59,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:22:59,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:22:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:59,584 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:22:59,584 INFO L226 Difference]: Without dead ends: 70 [2019-02-28 10:22:59,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:22:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-28 10:22:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-02-28 10:22:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:22:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-02-28 10:22:59,596 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-02-28 10:22:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:59,596 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-02-28 10:22:59,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-02-28 10:22:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:59,597 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:59,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:59,598 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-28 10:22:59,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:59,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:59,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:59,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:59,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:59,714 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:59,714 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-28 10:22:59,718 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:59,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:59,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:59,721 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:59,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:59,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:59,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:59,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:59,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:59,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:59,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:59,749 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:22:59,771 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:22:59,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,788 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:22:59,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,805 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:22:59,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,827 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:22:59,827 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,837 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,848 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,858 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,869 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,887 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:59,887 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:22:59,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,930 INFO L442 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 31 treesize of output 26 [2019-02-28 10:22:59,931 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,952 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:59,952 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:59,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,981 INFO L442 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 33 treesize of output 28 [2019-02-28 10:22:59,981 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,996 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:22:59,997 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:00,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:00,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:00,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:00,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:00,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:00,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:00,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:00,059 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-02-28 10:23:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:00,346 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-02-28 10:23:00,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:00,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:23:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:00,348 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:23:00,348 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:23:00,349 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-02-28 10:23:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:23:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-02-28 10:23:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:23:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-28 10:23:00,359 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-02-28 10:23:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:00,360 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-28 10:23:00,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-28 10:23:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:00,360 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:00,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:00,361 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-28 10:23:00,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:00,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:00,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:00,512 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2019-02-28 10:23:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:00,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:00,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:00,578 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:00,578 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-28 10:23:00,580 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:00,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:00,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:00,583 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:00,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:00,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:00,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:00,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:00,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:00,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:00,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:00,602 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:00,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,607 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:00,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,612 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,613 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:00,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,623 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:00,626 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,627 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,636 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:00,636 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,647 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,657 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,668 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,677 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,696 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:00,697 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:00,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,744 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,745 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,746 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,747 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,748 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,749 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,750 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,753 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:00,753 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,769 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:00,770 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:00,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,792 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,797 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,800 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:00,801 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,820 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:00,820 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:00,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,845 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,846 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,852 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,853 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,856 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:00,857 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,874 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:00,875 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:00,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:00,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:00,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:00,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:00,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:00,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:00,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:00,988 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-02-28 10:23:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:01,711 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-02-28 10:23:01,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:01,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:23:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:01,712 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:23:01,712 INFO L226 Difference]: Without dead ends: 70 [2019-02-28 10:23:01,712 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-02-28 10:23:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-28 10:23:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-02-28 10:23:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:23:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-02-28 10:23:01,722 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-02-28 10:23:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:01,722 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-02-28 10:23:01,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-02-28 10:23:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:01,723 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:01,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:01,723 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-28 10:23:01,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:01,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:01,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:01,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:01,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:01,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:01,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:01,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:01,866 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-28 10:23:01,867 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:01,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:01,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:01,870 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:01,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:01,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:01,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:01,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:01,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:01,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:01,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:01,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:01,902 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:01,909 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,909 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:01,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,915 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:01,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,930 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:01,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,951 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:01,952 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:01,966 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:01,978 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:01,986 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:01,996 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,015 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:02,016 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:02,065 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,075 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:02,076 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,317 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:02,317 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:02,517 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-28 10:23:02,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,762 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,763 INFO L289 Elim1Store]: Index analysis took 228 ms [2019-02-28 10:23:02,764 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:02,764 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:03,010 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:03,010 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:03,214 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-02-28 10:23:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:03,217 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:03,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:03,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:03,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:03,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:03,268 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-02-28 10:23:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:03,630 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-02-28 10:23:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:03,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:23:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:03,632 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:23:03,632 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:23:03,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:23:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-02-28 10:23:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:23:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-28 10:23:03,644 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-02-28 10:23:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:03,644 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-28 10:23:03,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-28 10:23:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:03,645 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:03,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:03,645 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-02-28 10:23:03,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:03,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:03,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:04,141 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-02-28 10:23:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:04,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:04,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:04,247 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:04,247 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-02-28 10:23:04,249 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:04,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:04,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:04,252 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:04,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:04,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:04,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:04,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:04,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:04,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:04,284 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:04,322 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,323 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:04,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,379 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,380 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,381 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:04,383 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,386 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,388 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,389 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:04,423 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,450 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,635 INFO L289 Elim1Store]: Index analysis took 233 ms [2019-02-28 10:23:04,636 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:04,637 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,760 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,904 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,043 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,198 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,438 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:05,439 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:05,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,572 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,590 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,592 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,592 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,596 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:05,596 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,615 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:05,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:05,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,677 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,679 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:05,680 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,727 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:05,728 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:05,749 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,750 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,750 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,751 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,754 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,755 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,758 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,759 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:05,760 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,811 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:05,811 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:05,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:05,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:05,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:05,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:05,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:05,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:05,888 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-02-28 10:23:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:06,506 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-02-28 10:23:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:06,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:23:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:06,508 INFO L225 Difference]: With dead ends: 93 [2019-02-28 10:23:06,508 INFO L226 Difference]: Without dead ends: 92 [2019-02-28 10:23:06,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-28 10:23:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-02-28 10:23:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-28 10:23:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-02-28 10:23:06,521 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-02-28 10:23:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:06,522 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-02-28 10:23:06,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-02-28 10:23:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:06,522 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:06,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:06,523 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-28 10:23:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:06,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:06,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:06,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:06,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:06,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:06,568 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-28 10:23:06,572 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:06,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:06,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:06,575 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:23:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:06,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:06,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:06,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:06,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:06,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:06,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:23:06,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:06,623 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:06,719 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:06,734 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:23:06,736 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,763 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:23:06,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,773 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,803 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:23:06,803 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,816 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,830 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,843 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,855 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,901 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:06,902 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-28 10:23:06,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,935 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:23:06,936 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,949 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:06,949 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-28 10:23:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:06,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:07,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:23:07,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-28 10:23:07,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:23:07,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:23:07,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:23:07,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:23:07,007 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-02-28 10:23:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:07,064 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-02-28 10:23:07,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:23:07,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:23:07,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:07,065 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:23:07,065 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:23:07,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:23:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:23:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-02-28 10:23:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:23:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-02-28 10:23:07,078 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-02-28 10:23:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:07,078 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-02-28 10:23:07,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:23:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-02-28 10:23:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:07,079 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:07,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:07,079 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:07,080 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-02-28 10:23:07,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:07,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:07,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:07,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:07,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:07,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:07,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:07,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:07,142 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-28 10:23:07,143 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:07,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:07,146 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:07,146 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:07,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:07,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:07,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:07,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:07,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:07,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:07,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:07,164 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:07,178 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:07,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,191 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:07,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,195 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,207 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:07,210 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,211 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,214 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,216 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,274 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:07,274 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,284 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,294 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,304 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,313 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,329 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:07,329 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:07,352 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,353 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,356 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,359 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:07,359 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,371 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:07,371 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:07,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,388 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,389 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,390 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,392 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,392 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:07,393 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,407 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:07,407 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:07,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-02-28 10:23:07,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:07,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:07,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:07,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:07,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:07,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:07,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:07,458 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-02-28 10:23:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:07,804 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-02-28 10:23:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:07,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:23:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:07,805 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:23:07,805 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:23:07,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:23:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-02-28 10:23:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-28 10:23:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-02-28 10:23:07,829 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-02-28 10:23:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:07,829 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-02-28 10:23:07,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-02-28 10:23:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:07,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:07,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:07,829 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-02-28 10:23:07,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:07,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:07,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:08,092 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-28 10:23:08,488 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-28 10:23:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:08,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:08,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:08,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:08,495 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-02-28 10:23:08,496 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:08,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:08,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:08,499 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:08,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:08,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:08,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:08,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:08,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:08,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:08,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:08,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:08,516 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:08,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,520 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:08,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,525 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:08,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,532 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,535 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:08,537 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,543 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,548 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:08,548 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,558 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,568 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,578 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,588 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,607 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:08,608 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:08,627 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,637 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:08,638 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,656 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:08,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:08,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,806 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,816 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:08,816 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,836 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:08,836 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:08,855 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,859 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,860 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,861 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,862 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,864 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,865 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:08,866 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,884 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:08,885 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:08,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:08,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:08,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:08,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:08,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:08,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:08,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:08,976 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-02-28 10:23:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:09,727 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-02-28 10:23:09,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:09,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:23:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:09,729 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:23:09,729 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:23:09,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:23:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-02-28 10:23:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:23:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-02-28 10:23:09,745 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-02-28 10:23:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:09,746 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-02-28 10:23:09,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-02-28 10:23:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:09,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:09,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:09,746 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:09,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:09,747 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-28 10:23:09,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:09,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:09,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:09,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:09,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:09,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:09,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:09,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:09,863 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-28 10:23:09,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:09,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:09,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:09,867 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:09,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:09,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:09,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:09,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:09,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:09,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:09,885 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:09,898 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:09,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,912 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:09,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,165 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:10,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,215 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,229 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:10,230 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,239 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,249 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,259 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,269 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,284 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:10,285 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:10,314 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,315 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,316 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,316 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,319 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,320 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:10,320 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,363 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:10,363 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:10,380 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,386 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,390 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:10,390 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,403 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:10,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:10,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:10,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:10,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:10,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:10,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:10,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:10,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:10,460 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-02-28 10:23:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:10,780 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-02-28 10:23:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:10,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:23:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:10,781 INFO L225 Difference]: With dead ends: 82 [2019-02-28 10:23:10,782 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:23:10,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:23:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-02-28 10:23:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:23:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-02-28 10:23:10,801 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-02-28 10:23:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:10,801 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-02-28 10:23:10,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-02-28 10:23:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:10,802 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:10,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:10,802 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-28 10:23:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:10,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:10,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:11,078 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 10:23:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:11,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:11,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:11,131 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-28 10:23:11,132 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:11,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:11,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:11,137 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:11,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:11,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:11,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:11,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:11,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:11,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:11,156 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:11,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,159 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:11,164 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,165 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,166 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,168 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:11,171 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,172 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,172 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,176 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:11,178 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,180 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,182 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,183 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,184 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,188 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,190 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:11,190 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:11,200 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:11,210 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:11,221 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:11,231 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:11,250 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:11,251 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:11,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,270 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,271 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,272 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,273 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,274 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,275 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,276 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,277 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:11,278 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:11,302 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:11,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:11,462 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,486 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,488 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:11,497 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:11,498 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:11,516 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:11,516 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:11,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:11,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:11,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:23:11,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:11,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:11,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:11,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:23:11,585 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-02-28 10:23:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:11,933 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-02-28 10:23:11,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:11,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:23:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:11,934 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:23:11,934 INFO L226 Difference]: Without dead ends: 86 [2019-02-28 10:23:11,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-28 10:23:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-02-28 10:23:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:23:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-02-28 10:23:11,955 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-02-28 10:23:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:11,956 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-02-28 10:23:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-02-28 10:23:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:11,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:11,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:11,957 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-28 10:23:11,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:11,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:11,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:12,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:12,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:12,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:12,090 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-28 10:23:12,090 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:12,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:12,093 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:12,093 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:12,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:12,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:12,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:12,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:12,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:12,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:12,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:12,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:12,114 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:12,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,116 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:12,118 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,119 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,120 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,121 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:12,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,131 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:12,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,137 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,139 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,141 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,142 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,144 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:12,144 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,156 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,171 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,179 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,189 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,208 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:12,208 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:12,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,235 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,237 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,245 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:12,245 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,262 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:12,263 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:12,283 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,284 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,284 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,285 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,286 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,288 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,289 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,290 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,292 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,292 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:12,293 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,312 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:12,313 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:12,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:12,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:12,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:12,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:12,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:12,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:12,420 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-02-28 10:23:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:12,772 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-02-28 10:23:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:12,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:23:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:12,774 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:23:12,774 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:23:12,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:23:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-02-28 10:23:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:23:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-02-28 10:23:12,793 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-02-28 10:23:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:12,794 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-02-28 10:23:12,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-02-28 10:23:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:12,794 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:12,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:12,794 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:12,795 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-02-28 10:23:12,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:12,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:12,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:13,079 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-28 10:23:13,296 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 10:23:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:13,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:13,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:13,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:13,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:13,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:13,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:13,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:13,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:13,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:23:13,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:13,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:13,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:13,324 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:13,335 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:13,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,347 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:13,350 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,352 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,365 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:13,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,372 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,383 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:13,383 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,392 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,402 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,412 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,422 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,438 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:13,438 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:13,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,522 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:13,522 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,536 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:13,537 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:13,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,556 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,558 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,558 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:13,559 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,573 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:13,574 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:13,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:13,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:13,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:23:13,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:13,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:13,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:13,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:23:13,620 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-02-28 10:23:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:14,523 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-02-28 10:23:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:14,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:23:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:14,525 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:23:14,525 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:23:14,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:23:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-02-28 10:23:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:23:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-02-28 10:23:14,545 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-02-28 10:23:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:14,545 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-02-28 10:23:14,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-02-28 10:23:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:14,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:14,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:14,546 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-28 10:23:14,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:14,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:14,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:14,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:14,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:14,601 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:14,601 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-02-28 10:23:14,602 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:14,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:14,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:14,605 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:23:14,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:14,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:14,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:14,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:14,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:14,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:14,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:23:14,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:14,626 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:14,636 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:14,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,649 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:14,651 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,653 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,666 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:14,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,687 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:14,688 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,698 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,708 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,719 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,730 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,748 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:14,748 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:14,781 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,783 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,787 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:14,788 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,801 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:14,801 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:14,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:14,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:14,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:23:14,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:14,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:23:14,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:23:14,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:23:14,846 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-02-28 10:23:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:15,081 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-02-28 10:23:15,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:23:15,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-28 10:23:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:15,083 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:23:15,083 INFO L226 Difference]: Without dead ends: 86 [2019-02-28 10:23:15,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:23:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-28 10:23:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-02-28 10:23:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:23:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-02-28 10:23:15,102 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-02-28 10:23:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:15,103 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-02-28 10:23:15,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:23:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-02-28 10:23:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:15,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:15,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:15,104 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-02-28 10:23:15,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:15,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:15,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:15,279 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-28 10:23:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:15,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:15,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:15,319 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:15,320 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-02-28 10:23:15,321 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:15,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:15,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:15,323 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:15,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:15,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:15,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:15,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:15,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:15,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:15,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:15,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:15,344 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:15,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,346 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:15,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,350 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,352 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,352 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:15,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,356 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,358 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,360 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,360 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:15,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,365 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,372 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,374 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:15,374 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,384 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,394 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,404 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,413 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,431 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:15,432 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:15,454 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,456 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,457 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,457 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,458 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,459 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,460 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,461 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,462 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:15,463 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,481 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:15,481 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:15,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,536 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,537 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,537 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,543 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:15,544 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,561 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:15,561 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:15,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,585 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,587 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,590 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,592 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:15,593 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,612 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:15,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:15,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:15,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:15,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:15,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:15,684 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-02-28 10:23:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:16,223 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-02-28 10:23:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:16,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:23:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:16,226 INFO L225 Difference]: With dead ends: 133 [2019-02-28 10:23:16,226 INFO L226 Difference]: Without dead ends: 132 [2019-02-28 10:23:16,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-02-28 10:23:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-02-28 10:23:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:23:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-02-28 10:23:16,252 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-02-28 10:23:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:16,252 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-02-28 10:23:16,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-02-28 10:23:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:23:16,253 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:16,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:23:16,253 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:16,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:16,253 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-02-28 10:23:16,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:16,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:16,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:16,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:16,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:16,480 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 10:23:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:16,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:16,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:16,488 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:23:16,488 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-28 10:23:16,489 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:16,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:16,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:16,492 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:16,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:16,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:16,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:16,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:16,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:16,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:16,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:16,516 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:16,530 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:16,532 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,545 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:16,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,551 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,562 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:16,565 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,566 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,567 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,568 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,569 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,579 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:16,580 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,588 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,597 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,607 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,617 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,633 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:16,633 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:16,659 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,659 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,663 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:16,663 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,678 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:16,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:16,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,698 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,698 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:16,699 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,719 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:16,719 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:16,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:16,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:16,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:16,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:16,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:16,769 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-02-28 10:23:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:17,158 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-02-28 10:23:17,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:17,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:23:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:17,159 INFO L225 Difference]: With dead ends: 113 [2019-02-28 10:23:17,159 INFO L226 Difference]: Without dead ends: 112 [2019-02-28 10:23:17,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-28 10:23:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-02-28 10:23:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:23:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-02-28 10:23:17,186 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-02-28 10:23:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:17,187 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-02-28 10:23:17,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-02-28 10:23:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:17,187 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:17,188 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:23:17,188 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-02-28 10:23:17,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:17,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:17,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:17,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:17,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:17,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:17,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:17,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:17,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:17,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:17,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:17,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:17,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:17,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:17,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:17,342 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:17,344 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,344 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:17,348 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,350 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:17,351 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,352 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,356 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,357 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:17,360 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,362 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,365 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,370 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:17,371 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,379 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,388 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,398 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,407 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,425 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:17,426 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:17,489 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,489 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,497 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:17,497 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,515 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:17,516 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:17,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,550 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,552 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,556 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:17,556 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,574 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:17,575 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:17,606 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,612 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,614 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,615 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:17,616 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,635 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:17,636 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:17,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,668 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,671 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:17,671 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,691 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:17,692 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:17,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:17,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:17,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:23:17,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:17,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:23:17,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:23:17,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:17,782 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-02-28 10:23:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:18,608 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-02-28 10:23:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:18,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-28 10:23:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:18,610 INFO L225 Difference]: With dead ends: 136 [2019-02-28 10:23:18,611 INFO L226 Difference]: Without dead ends: 131 [2019-02-28 10:23:18,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:23:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-28 10:23:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-02-28 10:23:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:23:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-28 10:23:18,636 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-28 10:23:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:18,636 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-28 10:23:18,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:23:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-28 10:23:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:18,637 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:18,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:18,637 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-28 10:23:18,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:18,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:18,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:18,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:18,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:18,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:18,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:18,826 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:18,826 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-28 10:23:18,827 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:18,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:18,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:18,830 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:18,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:18,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:18,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:18,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:18,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:18,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:18,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:18,853 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:18,855 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,855 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:18,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,859 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,860 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,861 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:18,864 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,866 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,868 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,869 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,870 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,871 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:18,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,885 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:18,886 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,897 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,907 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,918 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,928 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,948 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:18,948 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:18,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,974 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,976 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,977 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,981 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:18,982 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,001 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:19,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:19,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,030 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,032 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,036 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:19,036 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,090 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:19,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:19,118 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,119 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,120 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,121 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,122 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,129 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:19,130 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,150 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:19,151 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:19,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:19,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:19,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:19,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:19,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:19,234 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-02-28 10:23:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:19,747 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-02-28 10:23:19,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:19,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:19,749 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:23:19,749 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:23:19,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 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-02-28 10:23:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:23:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-02-28 10:23:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:23:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-28 10:23:19,770 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-28 10:23:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:19,771 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-28 10:23:19,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-28 10:23:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:19,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:19,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:19,771 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:19,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:19,772 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-02-28 10:23:19,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:19,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:19,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:19,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:19,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:19,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:19,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:19,986 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:19,986 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-02-28 10:23:19,987 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:19,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:19,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:19,990 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:23:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:19,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:19,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:19,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:19,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:19,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:20,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:20,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:20,009 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:20,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,012 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:20,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,019 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:20,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,030 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:20,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,048 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:20,048 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,061 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,071 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,082 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,112 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,131 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:20,132 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:20,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,159 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,162 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,163 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,164 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,165 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,166 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,167 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:20,168 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,187 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:20,188 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:20,215 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,216 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,217 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,223 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,225 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:20,226 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,245 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:20,246 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:20,271 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,272 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,273 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,274 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,275 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,276 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,277 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,317 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,324 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,325 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:20,326 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,344 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:20,345 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:20,406 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,429 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,433 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,434 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,437 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:20,437 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,457 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:20,458 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:20,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:20,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:20,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:23:20,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:20,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:20,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:20,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:20,564 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-02-28 10:23:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:21,352 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-02-28 10:23:21,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:21,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:21,355 INFO L225 Difference]: With dead ends: 131 [2019-02-28 10:23:21,355 INFO L226 Difference]: Without dead ends: 130 [2019-02-28 10:23:21,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-28 10:23:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-02-28 10:23:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:23:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-28 10:23:21,380 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-28 10:23:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:21,380 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-28 10:23:21,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-28 10:23:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:21,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:21,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:21,381 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:21,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-02-28 10:23:21,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:21,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:21,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:21,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:21,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:21,570 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-28 10:23:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:21,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:21,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:21,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:21,592 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-28 10:23:21,593 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:21,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:21,597 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:21,597 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:21,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:21,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:21,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:21,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:21,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:21,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:23:21,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:21,615 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:21,629 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:21,646 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:23:21,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,667 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:23:21,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,691 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:23:21,691 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,700 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,710 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,720 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,729 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,744 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:21,744 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-28 10:23:21,771 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,771 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,773 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:23:21,773 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,783 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:21,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:23:21,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,801 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:23:21,801 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,812 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:21,812 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:23:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:21,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:21,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:21,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:21,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:21,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:21,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:21,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:21,890 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-02-28 10:23:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:22,166 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-02-28 10:23:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:22,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:22,168 INFO L225 Difference]: With dead ends: 93 [2019-02-28 10:23:22,168 INFO L226 Difference]: Without dead ends: 92 [2019-02-28 10:23:22,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-28 10:23:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-02-28 10:23:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:23:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-02-28 10:23:22,192 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-02-28 10:23:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:22,192 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-02-28 10:23:22,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-02-28 10:23:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:22,193 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:22,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:22,193 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-02-28 10:23:22,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:22,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:22,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:22,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:22,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:22,496 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:22,496 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-02-28 10:23:22,497 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:22,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:22,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:22,499 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:23:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:22,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:22,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:22,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:22,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:22,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:22,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:22,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:22,516 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:22,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,519 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:22,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,526 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:22,532 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,532 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,536 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:22,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,543 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,549 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:22,550 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,560 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,570 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,580 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,592 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,611 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,612 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:22,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,642 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,645 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,646 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,650 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,650 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:22,651 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,671 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:22,671 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:22,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,703 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,705 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:22,706 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,725 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:22,725 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:22,748 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,749 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,749 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,750 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,751 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,754 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,755 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,758 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:22,758 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,778 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:22,779 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:22,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,806 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,813 INFO L442 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 40 treesize of output 35 [2019-02-28 10:23:22,813 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,833 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:22,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:23:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:22,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:22,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:22,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:23:22,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:22,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:22,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:22,958 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-02-28 10:23:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:23,932 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-02-28 10:23:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:23,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:23,934 INFO L225 Difference]: With dead ends: 117 [2019-02-28 10:23:23,934 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:23:23,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:23:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:23:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-02-28 10:23:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-28 10:23:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-02-28 10:23:23,966 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-02-28 10:23:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:23,966 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-02-28 10:23:23,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-02-28 10:23:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:23,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:23,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:23,967 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:23,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:23,967 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-28 10:23:23,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:23,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:23,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:23,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:23,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:24,264 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-28 10:23:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:24,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:24,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:24,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:24,329 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-28 10:23:24,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:24,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:24,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:24,333 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:24,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:24,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:24,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:24,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:24,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:24,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:24,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:24,353 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:24,362 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:24,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,375 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:24,377 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,378 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,379 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,390 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:24,393 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,394 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,395 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,396 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,398 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,399 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,408 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:24,409 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,417 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,428 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,437 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,466 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,481 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:24,481 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:24,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,522 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:24,523 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,537 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:24,537 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:24,557 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,558 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,558 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,559 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,560 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,561 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,562 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:24,563 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,577 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:24,578 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:24,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:24,605 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:24,605 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:24,622 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:24,622 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:24,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:24,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:24,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:24,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:24,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:24,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:24,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:24,696 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-02-28 10:23:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:25,144 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-02-28 10:23:25,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:25,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:25,146 INFO L225 Difference]: With dead ends: 99 [2019-02-28 10:23:25,146 INFO L226 Difference]: Without dead ends: 98 [2019-02-28 10:23:25,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-28 10:23:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-02-28 10:23:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:23:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-02-28 10:23:25,168 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-02-28 10:23:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:25,169 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-02-28 10:23:25,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-02-28 10:23:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:25,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:25,169 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:23:25,170 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:25,170 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-02-28 10:23:25,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:25,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:25,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:25,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:25,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:25,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:25,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:25,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:25,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:25,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:25,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:25,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:23:25,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:23:25,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:23:25,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:25,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:25,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:25,376 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:25,415 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,416 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:25,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,428 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:25,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,434 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,435 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,438 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:25,441 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,442 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,443 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,444 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,445 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,446 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,448 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,449 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,450 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,451 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,452 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:25,452 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,463 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,473 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,483 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,493 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,512 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:25,513 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:25,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,551 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,552 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,556 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,558 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:25,558 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,579 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:25,579 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:25,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,624 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:25,624 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,644 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:25,644 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:25,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,678 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:25,679 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,698 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:25,699 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:25,721 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,721 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,725 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,729 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:25,730 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:25,730 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:25,748 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:25,749 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:25,777 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:25,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:25,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:23:25,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:25,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:23:25,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:23:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:25,846 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-02-28 10:23:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:26,570 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-02-28 10:23:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:26,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-28 10:23:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:26,572 INFO L225 Difference]: With dead ends: 132 [2019-02-28 10:23:26,572 INFO L226 Difference]: Without dead ends: 130 [2019-02-28 10:23:26,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:23:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-28 10:23:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-02-28 10:23:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-28 10:23:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-02-28 10:23:26,611 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-02-28 10:23:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:26,612 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-02-28 10:23:26,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:23:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-02-28 10:23:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:26,613 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:26,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:26,613 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:26,614 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-02-28 10:23:26,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:26,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:26,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:26,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:26,909 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-28 10:23:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:26,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:26,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:26,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:26,938 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-28 10:23:26,940 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:26,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:26,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:26,943 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:26,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:26,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:26,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:26,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:26,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:26,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:26,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:26,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:26,977 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:27,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,010 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:27,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,061 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,086 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:27,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,141 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,142 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:27,145 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,146 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,152 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,162 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,164 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,167 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,170 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,170 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:27,171 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,183 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,194 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,207 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,226 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,250 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:27,250 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:27,284 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,289 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,292 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,302 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,304 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,307 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:27,308 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,331 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:27,332 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:27,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,365 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,377 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,379 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:27,380 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:27,381 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:27,400 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:27,400 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:27,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:27,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:27,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:27,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:27,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:27,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:27,500 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-02-28 10:23:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:27,863 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-02-28 10:23:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:27,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:27,865 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:23:27,865 INFO L226 Difference]: Without dead ends: 86 [2019-02-28 10:23:27,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-28 10:23:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-02-28 10:23:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:23:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-02-28 10:23:27,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-02-28 10:23:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:27,899 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-02-28 10:23:27,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-02-28 10:23:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:27,899 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:27,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:27,900 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-02-28 10:23:27,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:27,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:27,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:28,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:28,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:28,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:28,035 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-02-28 10:23:28,036 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:28,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:28,039 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:28,039 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:28,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:28,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:28,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:28,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:28,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:28,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:28,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:28,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:28,090 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:28,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,135 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:28,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,137 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,139 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:28,142 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,144 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,145 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,146 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,147 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,148 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:28,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,152 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,153 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,154 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,159 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,160 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,162 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:28,162 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,173 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,183 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,193 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,204 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,222 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:28,223 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:28,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,250 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,251 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,253 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,254 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:28,255 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,274 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:28,274 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:28,294 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,296 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,298 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,300 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,301 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,304 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,305 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:28,305 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,325 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:28,325 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:28,344 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,350 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,351 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,352 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,353 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:28,355 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:28,356 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:28,375 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:28,376 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:28,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:28,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:23:28,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:28,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:28,441 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-02-28 10:23:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:28,914 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-02-28 10:23:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:28,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:28,916 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:23:28,916 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:23:28,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:23:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-02-28 10:23:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:23:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-02-28 10:23:28,955 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-02-28 10:23:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:28,956 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-02-28 10:23:28,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-02-28 10:23:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:28,957 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:28,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:28,957 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-28 10:23:28,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:28,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:28,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:28,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:28,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:29,136 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-28 10:23:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:29,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:29,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:29,198 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:29,198 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-28 10:23:29,199 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:29,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:29,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:29,201 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:29,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:29,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:29,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:29,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:29,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:29,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:29,254 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:29,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,269 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:29,274 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,277 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,279 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,279 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:29,281 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,283 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,289 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,291 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,293 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,293 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:29,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,301 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,309 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,312 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,312 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,314 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:29,314 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,325 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,335 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,345 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,355 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,374 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:29,375 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:29,418 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,423 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,429 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:29,430 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,449 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:29,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:29,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,476 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,478 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,480 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:29,480 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,499 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:29,500 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:29,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,556 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,557 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,557 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,558 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,559 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,560 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,561 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,563 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:29,563 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:29,564 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:29,583 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:29,584 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:29,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:29,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:29,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:29,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:29,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:29,667 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-02-28 10:23:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:30,196 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-02-28 10:23:30,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:30,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:30,198 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:23:30,198 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:23:30,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:23:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-02-28 10:23:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:23:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-02-28 10:23:30,231 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-02-28 10:23:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:30,231 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-02-28 10:23:30,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-02-28 10:23:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:30,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:30,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:30,232 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:30,232 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-02-28 10:23:30,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:30,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:30,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:30,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:30,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:30,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:30,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:30,334 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:30,334 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-28 10:23:30,335 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:30,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:30,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:30,338 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:30,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:30,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:30,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:30,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:30,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:30,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:30,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:30,359 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:30,372 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:30,383 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,405 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:30,407 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,410 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,412 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,422 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:30,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,429 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,440 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:30,440 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,449 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,459 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,469 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,479 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,495 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:30,495 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:30,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,536 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,537 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,538 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:30,538 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,553 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:30,553 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:30,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,572 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:30,576 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:30,577 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:30,589 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:30,590 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:30,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:30,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:30,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:30,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:30,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:30,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:30,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:30,665 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-02-28 10:23:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:30,950 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-02-28 10:23:30,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:30,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:30,951 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:23:30,952 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:23:30,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:23:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-02-28 10:23:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:23:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-02-28 10:23:30,981 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-02-28 10:23:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:30,981 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-02-28 10:23:30,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-02-28 10:23:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:30,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:30,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:30,982 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-02-28 10:23:30,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:30,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:31,523 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-28 10:23:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:31,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:31,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:31,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:31,672 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-02-28 10:23:31,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:31,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:31,676 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:31,677 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:31,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:31,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:31,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:31,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:31,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:31,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:31,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:31,702 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:31,713 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:31,715 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,724 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:31,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,729 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,739 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:31,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,744 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,745 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,746 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,756 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:31,757 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,766 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,776 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,786 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,796 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,812 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:31,813 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:31,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,850 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,851 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:31,852 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,866 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:31,867 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:31,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,923 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:31,924 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,937 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:31,937 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:31,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,959 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:31,962 INFO L442 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 35 treesize of output 30 [2019-02-28 10:23:31,963 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:31,978 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:31,978 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:23:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:31,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:32,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:32,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:32,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:32,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:32,047 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-02-28 10:23:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:32,513 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-02-28 10:23:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:32,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:32,514 INFO L225 Difference]: With dead ends: 116 [2019-02-28 10:23:32,514 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:23:32,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:23:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-02-28 10:23:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-28 10:23:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-02-28 10:23:32,545 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-02-28 10:23:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:32,545 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-02-28 10:23:32,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-02-28 10:23:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:32,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:32,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:32,546 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:32,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:32,546 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-02-28 10:23:32,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:32,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:32,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:32,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:32,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:32,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:32,752 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:32,752 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-02-28 10:23:32,753 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:32,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:32,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:32,756 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:23:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:32,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:32,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:32,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:32,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:32,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:32,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:32,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:32,781 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:32,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,786 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:32,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,792 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,792 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:32,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,808 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:32,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,822 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:32,822 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,833 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,843 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,853 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,863 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,882 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:32,882 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:32,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,909 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,917 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,918 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:32,919 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,936 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:32,937 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:32,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:32,969 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:32,969 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:32,989 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:32,989 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:33,058 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,059 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,060 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,061 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,061 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,063 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,064 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,072 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:33,072 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,090 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:33,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:33,148 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,171 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,214 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,216 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:33,222 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:33,222 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:33,241 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:33,241 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:33,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:33,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:33,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:23:33,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:33,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:33,357 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-02-28 10:23:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:34,292 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-02-28 10:23:34,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:34,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:34,294 INFO L225 Difference]: With dead ends: 140 [2019-02-28 10:23:34,294 INFO L226 Difference]: Without dead ends: 139 [2019-02-28 10:23:34,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-28 10:23:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-02-28 10:23:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:23:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-02-28 10:23:34,329 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-02-28 10:23:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:34,329 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-02-28 10:23:34,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-02-28 10:23:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:34,330 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:34,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:34,330 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-02-28 10:23:34,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:34,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:34,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:34,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:34,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:34,395 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:34,396 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-28 10:23:34,396 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:34,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:34,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:34,399 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:34,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:34,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:34,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:34,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:34,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:23:34,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:34,451 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:34,471 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:34,488 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:23:34,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,509 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:23:34,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,532 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:23:34,533 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,540 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,550 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,560 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,570 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,583 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:34,583 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-28 10:23:34,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,611 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:23:34,611 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,622 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:34,622 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:23:34,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:34,637 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:23:34,637 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:34,647 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:34,647 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:23:34,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-02-28 10:23:34,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:34,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:34,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:23:34,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:34,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:34,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:23:34,692 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-02-28 10:23:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:34,956 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-02-28 10:23:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:34,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:34,958 INFO L225 Difference]: With dead ends: 112 [2019-02-28 10:23:34,958 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:23:34,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:23:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-02-28 10:23:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:23:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-02-28 10:23:35,009 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-02-28 10:23:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:35,009 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-02-28 10:23:35,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-02-28 10:23:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:35,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:35,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:35,010 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:35,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-02-28 10:23:35,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:35,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:35,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:35,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:35,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:35,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:35,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:35,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:35,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:35,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:35,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:35,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:35,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:35,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:35,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:35,211 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:35,217 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,217 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:35,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,224 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:35,228 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,234 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,234 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,235 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,235 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:35,237 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,248 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:35,248 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,258 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,269 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,279 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,289 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,308 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:35,308 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:35,335 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,340 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,341 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,360 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,372 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,373 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:35,373 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,437 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:35,437 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:35,465 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,466 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,466 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,467 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,469 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,475 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:35,475 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,494 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:35,495 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:35,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,531 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:35,531 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,551 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:35,551 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:35,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,576 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,578 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:35,583 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:35,584 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:35,603 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:35,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:35,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:35,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:35,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:23:35,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:35,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:35,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:35,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:35,713 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-02-28 10:23:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:36,602 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-02-28 10:23:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:36,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:36,604 INFO L225 Difference]: With dead ends: 137 [2019-02-28 10:23:36,605 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:23:36,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:23:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-02-28 10:23:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:23:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-02-28 10:23:36,642 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-02-28 10:23:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:36,642 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-02-28 10:23:36,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-02-28 10:23:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:36,642 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:36,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:36,643 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-28 10:23:36,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:36,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:36,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:36,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:36,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:36,765 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:36,765 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-28 10:23:36,766 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:36,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:36,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:36,770 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:36,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:36,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:36,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:36,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:36,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:36,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:36,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:36,789 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:36,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,791 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:36,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,803 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:36,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,811 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:36,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,827 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:36,828 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:36,840 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:36,851 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:36,862 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:36,873 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:36,900 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:36,901 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:36,919 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,931 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:36,931 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:36,950 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:36,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:36,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,970 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,974 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,976 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,977 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:36,979 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:36,980 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:36,998 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:36,998 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:37,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,056 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,058 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,059 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,060 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,062 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,063 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,064 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,065 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:37,065 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:37,085 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:37,085 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:37,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:37,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:37,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:23:37,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:37,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:37,151 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-02-28 10:23:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:37,682 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-28 10:23:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:37,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:37,684 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:23:37,684 INFO L226 Difference]: Without dead ends: 123 [2019-02-28 10:23:37,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-28 10:23:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-02-28 10:23:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:23:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-02-28 10:23:37,726 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-02-28 10:23:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:37,726 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-02-28 10:23:37,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-02-28 10:23:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:37,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:37,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:37,727 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-28 10:23:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:37,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:37,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:37,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:37,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:37,857 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:37,857 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-28 10:23:37,858 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:37,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:37,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:37,860 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:37,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:37,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:37,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:37,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:37,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:37,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:37,878 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:37,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,880 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:37,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,892 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:37,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,902 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:37,904 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,905 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,907 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,909 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,915 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:37,916 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:37,925 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:37,934 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:37,944 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:37,954 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:37,972 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:37,972 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:37,991 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:37,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,000 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,002 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:38,002 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:38,021 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:38,022 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:38,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,055 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:38,055 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:38,075 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:38,075 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:38,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,103 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,107 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:38,107 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:38,127 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:38,127 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:38,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:38,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:38,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:23:38,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:38,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:23:38,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:23:38,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:38,209 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-02-28 10:23:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:38,709 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-02-28 10:23:38,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:38,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-28 10:23:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:38,710 INFO L225 Difference]: With dead ends: 119 [2019-02-28 10:23:38,710 INFO L226 Difference]: Without dead ends: 118 [2019-02-28 10:23:38,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-28 10:23:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-02-28 10:23:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:23:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-02-28 10:23:38,756 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-02-28 10:23:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:38,757 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-02-28 10:23:38,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:23:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-02-28 10:23:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:38,758 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:38,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:38,758 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-02-28 10:23:38,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:38,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:38,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:38,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:38,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:38,888 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-02-28 10:23:38,889 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:38,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:38,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:38,892 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:23:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:38,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:38,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:38,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:38,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:38,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:38,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:38,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:38,916 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:38,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,922 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:38,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,927 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:38,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,935 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:38,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:38,949 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:38,949 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:38,960 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:38,970 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:38,980 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:38,990 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:39,011 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:39,011 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:39,032 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,042 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:39,042 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:39,062 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:39,062 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:39,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,095 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,099 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:39,099 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:39,119 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:39,119 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:39,142 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,144 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,145 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,146 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,147 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,149 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,150 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,152 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:39,152 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:39,172 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:39,172 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:39,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,207 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,208 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,209 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,210 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,211 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,215 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,216 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:39,217 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:39,218 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:39,237 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:39,238 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:39,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:39,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:39,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:23:39,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:39,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:39,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:39,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:39,315 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-02-28 10:23:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:40,296 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-02-28 10:23:40,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:40,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:40,298 INFO L225 Difference]: With dead ends: 149 [2019-02-28 10:23:40,298 INFO L226 Difference]: Without dead ends: 148 [2019-02-28 10:23:40,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:23:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-02-28 10:23:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-02-28 10:23:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:23:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-02-28 10:23:40,350 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-02-28 10:23:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:40,350 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-02-28 10:23:40,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-02-28 10:23:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:40,351 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:40,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:40,351 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:40,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-02-28 10:23:40,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:40,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:40,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:40,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:40,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:40,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:40,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:40,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:40,506 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-28 10:23:40,508 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:40,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:40,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:40,511 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:40,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:40,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:40,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:40,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:40,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:40,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:40,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:40,538 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:40,555 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:40,559 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,566 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:40,569 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,583 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:40,585 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,587 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,600 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:40,600 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:40,608 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:40,618 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:40,628 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:40,638 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:40,655 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:40,655 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:40,684 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,685 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,687 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,688 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,690 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:40,691 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:40,705 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:40,706 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:40,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,725 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,729 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,730 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:40,731 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:40,745 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:40,746 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:40,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,764 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:40,769 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:40,770 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:40,784 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:40,785 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:40,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:40,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:40,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:40,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:40,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:40,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:40,858 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-02-28 10:23:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:41,371 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-02-28 10:23:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:41,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:41,373 INFO L225 Difference]: With dead ends: 139 [2019-02-28 10:23:41,373 INFO L226 Difference]: Without dead ends: 138 [2019-02-28 10:23:41,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-28 10:23:41,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-02-28 10:23:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:23:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-02-28 10:23:41,425 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-02-28 10:23:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:41,425 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-02-28 10:23:41,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-02-28 10:23:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:41,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:41,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:41,426 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-02-28 10:23:41,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:41,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:41,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:41,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:41,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:41,606 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:41,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:41,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:41,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:41,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:41,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:41,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:41,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:41,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:41,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:41,633 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:41,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,636 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:41,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,642 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,644 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:41,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,654 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,656 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,658 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,658 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:41,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,668 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,672 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:41,673 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:41,683 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:41,693 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:41,703 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:41,714 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:41,733 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:41,733 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:41,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,863 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,932 INFO L289 Elim1Store]: Index analysis took 139 ms [2019-02-28 10:23:41,933 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:41,933 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:41,950 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:41,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:41,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:41,995 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:41,996 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:42,014 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:42,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:42,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,049 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:42,049 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:42,069 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:42,069 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:42,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,095 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:42,102 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:42,102 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:42,122 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:42,122 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:42,184 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:42,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:42,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:23:42,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:42,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:42,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:42,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:42,262 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-02-28 10:23:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:43,121 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-02-28 10:23:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:43,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:43,123 INFO L225 Difference]: With dead ends: 164 [2019-02-28 10:23:43,123 INFO L226 Difference]: Without dead ends: 163 [2019-02-28 10:23:43,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-28 10:23:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-02-28 10:23:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:23:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-02-28 10:23:43,175 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-02-28 10:23:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:43,175 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-02-28 10:23:43,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-02-28 10:23:43,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:43,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:43,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:43,176 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-28 10:23:43,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:43,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:43,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:43,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:43,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:43,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:43,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:43,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:43,272 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-02-28 10:23:43,273 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:43,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:43,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:43,276 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:43,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:43,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:43,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:43,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:43,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:43,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:43,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:43,298 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:43,304 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,305 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:43,309 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,311 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,313 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:43,315 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,316 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,319 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,320 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,322 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,323 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:43,326 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,328 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,334 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,335 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,335 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,338 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:43,338 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:43,348 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:43,357 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:43,368 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:43,378 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:43,397 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:43,397 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:43,418 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,429 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:43,429 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:43,449 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:43,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:43,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,476 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,477 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,478 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,480 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:43,481 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:43,481 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:43,501 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:43,501 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:43,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:43,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:43,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:43,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:43,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:43,583 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-02-28 10:23:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:43,960 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-02-28 10:23:43,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:43,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:43,962 INFO L225 Difference]: With dead ends: 122 [2019-02-28 10:23:43,962 INFO L226 Difference]: Without dead ends: 121 [2019-02-28 10:23:43,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-28 10:23:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-02-28 10:23:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-28 10:23:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-02-28 10:23:44,020 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-02-28 10:23:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:44,021 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-02-28 10:23:44,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-02-28 10:23:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:44,021 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:44,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:44,021 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:44,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-02-28 10:23:44,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:44,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:44,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:44,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:44,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:44,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:44,141 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-02-28 10:23:44,142 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:44,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:44,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:44,145 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:44,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:44,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:44,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:44,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:44,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:44,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:44,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:44,171 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:44,178 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,178 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:44,180 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,182 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,184 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,184 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:44,188 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,192 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,194 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:44,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,198 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,227 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,234 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,234 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:44,234 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:44,244 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:44,254 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:44,264 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:44,274 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:44,293 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:44,293 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:44,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,314 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,315 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,316 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,317 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,320 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,321 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,322 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,323 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,324 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:44,324 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:44,344 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:44,344 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:44,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,372 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,375 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:44,376 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:44,395 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:44,395 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:44,416 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,417 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,418 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,418 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:44,425 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:44,426 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:44,445 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:44,446 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:44,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:44,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:44,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:23:44,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:44,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:44,508 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-02-28 10:23:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:45,048 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-02-28 10:23:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:45,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:45,051 INFO L225 Difference]: With dead ends: 154 [2019-02-28 10:23:45,051 INFO L226 Difference]: Without dead ends: 153 [2019-02-28 10:23:45,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-28 10:23:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-02-28 10:23:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:23:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-02-28 10:23:45,116 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-02-28 10:23:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:45,117 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-02-28 10:23:45,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-02-28 10:23:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:45,117 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:45,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:45,117 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-02-28 10:23:45,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:45,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:45,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:45,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:45,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:45,600 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-28 10:23:45,841 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-02-28 10:23:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:45,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:45,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:45,847 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:45,847 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-28 10:23:45,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:45,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:45,850 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:45,850 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:45,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:45,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:45,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:45,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:45,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:45,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:45,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:45,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:45,867 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:45,875 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:45,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,887 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:45,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,902 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:45,905 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,907 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:45,921 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:45,922 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:45,932 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:45,942 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:45,952 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:45,962 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:45,979 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:45,979 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:46,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,015 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:46,015 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,030 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:46,030 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:46,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,053 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:46,053 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,068 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:46,068 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:46,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:46,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:46,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:46,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:46,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:46,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:46,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:46,128 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-02-28 10:23:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:46,448 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-02-28 10:23:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:46,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:46,450 INFO L225 Difference]: With dead ends: 130 [2019-02-28 10:23:46,451 INFO L226 Difference]: Without dead ends: 129 [2019-02-28 10:23:46,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-28 10:23:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-02-28 10:23:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:23:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-02-28 10:23:46,510 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-02-28 10:23:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:46,510 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-02-28 10:23:46,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-02-28 10:23:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:46,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:46,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:46,511 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-02-28 10:23:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:46,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:46,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:46,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:46,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:46,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:46,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:46,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:46,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:46,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:46,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:46,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:46,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:46,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:46,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:46,657 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:46,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,663 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:46,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,671 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:46,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,677 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,681 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:46,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,703 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,706 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,708 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,709 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,710 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:46,710 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,720 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,731 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,741 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,752 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,772 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:46,773 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:46,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,797 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,808 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:46,808 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,833 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:46,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:46,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,859 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,860 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,862 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,863 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,864 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,866 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,867 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:46,867 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,887 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:46,887 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:46,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,917 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:46,920 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:46,921 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:46,940 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:46,940 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:46,964 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:47,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:47,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:23:47,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:47,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:23:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:23:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:47,014 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-02-28 10:23:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:47,522 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-02-28 10:23:47,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:47,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-28 10:23:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:47,525 INFO L225 Difference]: With dead ends: 160 [2019-02-28 10:23:47,525 INFO L226 Difference]: Without dead ends: 159 [2019-02-28 10:23:47,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:23:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-28 10:23:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-02-28 10:23:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-28 10:23:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-02-28 10:23:47,594 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-02-28 10:23:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:47,594 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-02-28 10:23:47,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:23:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-02-28 10:23:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:47,595 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:47,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:47,595 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-02-28 10:23:47,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:47,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:47,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:47,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:47,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:47,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:47,731 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-02-28 10:23:47,734 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:47,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:47,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:47,737 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:23:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:47,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:47,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:47,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:47,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:47,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:47,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:23:47,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:47,754 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:47,776 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:47,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,792 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:47,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,810 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:47,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,822 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,836 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:47,836 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:47,848 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:47,861 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:47,872 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:47,884 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:47,904 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:47,905 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:47,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:47,952 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:47,952 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:47,970 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:47,970 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:47,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:48,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-02-28 10:23:48,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:23:48,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-28 10:23:48,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:23:48,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:23:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:23:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:23:48,028 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-02-28 10:23:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:48,135 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-02-28 10:23:48,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:23:48,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:23:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:48,137 INFO L225 Difference]: With dead ends: 121 [2019-02-28 10:23:48,137 INFO L226 Difference]: Without dead ends: 117 [2019-02-28 10:23:48,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:23:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-28 10:23:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-02-28 10:23:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-28 10:23:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-02-28 10:23:48,203 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-02-28 10:23:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:48,203 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-02-28 10:23:48,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:23:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-02-28 10:23:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:48,204 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:48,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:48,204 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-02-28 10:23:48,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:48,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:48,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:48,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:48,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:48,474 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-02-28 10:23:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:48,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:48,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:48,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:48,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:48,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:48,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:48,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:48,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:48,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:48,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:48,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:48,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:48,568 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:48,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,575 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:48,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,581 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:48,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,585 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,590 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,591 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:48,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,596 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,605 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:48,606 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,616 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,627 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,638 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,648 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,668 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:48,668 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:48,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,698 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,703 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,708 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:48,709 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,728 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:48,728 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:48,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,758 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,760 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,762 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,764 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,767 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:48,767 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,786 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:48,787 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:48,838 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,840 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,841 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,841 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,845 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,846 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,847 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:48,847 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,867 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:48,868 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:48,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,893 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,895 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,896 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,903 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:48,904 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:48,904 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:48,924 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:48,924 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:48,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:49,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:49,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:23:49,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:49,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:49,017 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-02-28 10:23:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:49,915 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-02-28 10:23:49,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:49,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:49,918 INFO L225 Difference]: With dead ends: 186 [2019-02-28 10:23:49,918 INFO L226 Difference]: Without dead ends: 184 [2019-02-28 10:23:49,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-28 10:23:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-02-28 10:23:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-28 10:23:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-02-28 10:23:49,999 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-02-28 10:23:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:50,000 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-02-28 10:23:50,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-02-28 10:23:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:50,000 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:50,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:50,001 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:50,001 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-02-28 10:23:50,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:50,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:50,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:50,232 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-28 10:23:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:50,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:50,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:50,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:50,257 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-02-28 10:23:50,258 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:50,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:50,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:50,260 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:50,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:50,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:50,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:50,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:50,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:50,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:50,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:50,278 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:50,285 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:50,288 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,300 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:50,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,306 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,317 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:50,320 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,321 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,322 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,324 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,326 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,337 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:50,337 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:50,346 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:50,356 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:50,366 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:50,376 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:50,393 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:50,393 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:50,417 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,418 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,423 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:50,423 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:50,438 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:50,438 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:50,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,507 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,508 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,509 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:50,511 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:50,511 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:50,525 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:50,525 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:50,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:50,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:50,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:23:50,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:50,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:23:50,573 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-02-28 10:23:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:50,917 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-02-28 10:23:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:50,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:50,919 INFO L225 Difference]: With dead ends: 161 [2019-02-28 10:23:50,919 INFO L226 Difference]: Without dead ends: 160 [2019-02-28 10:23:50,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-28 10:23:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-02-28 10:23:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-28 10:23:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-02-28 10:23:50,996 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-02-28 10:23:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:50,996 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-02-28 10:23:50,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-02-28 10:23:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:50,997 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:50,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:50,997 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-02-28 10:23:50,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:50,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:50,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:50,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:50,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:51,353 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-28 10:23:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:51,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:51,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:51,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:51,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:51,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:51,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:51,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:51,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:51,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:23:51,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:51,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:23:51,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:51,396 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:51,405 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:51,423 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:23:51,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,443 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:23:51,446 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,446 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,447 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,466 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:23:51,466 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:51,475 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:51,485 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:51,495 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:51,505 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:51,519 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:51,519 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-28 10:23:51,564 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,564 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,565 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,566 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:23:51,566 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:51,574 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:51,575 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:23:51,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,592 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:51,594 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:23:51,594 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:51,605 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:51,605 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:23:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:51,621 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:51,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:51,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:51,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:51,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:51,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:51,660 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-02-28 10:23:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:52,001 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-02-28 10:23:52,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:52,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:52,003 INFO L225 Difference]: With dead ends: 172 [2019-02-28 10:23:52,004 INFO L226 Difference]: Without dead ends: 170 [2019-02-28 10:23:52,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-28 10:23:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-02-28 10:23:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-28 10:23:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-02-28 10:23:52,086 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-02-28 10:23:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:52,087 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-02-28 10:23:52,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-02-28 10:23:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:52,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:52,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:52,088 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-02-28 10:23:52,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:52,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:52,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:52,242 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-28 10:23:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:52,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:52,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:52,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:52,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:52,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:52,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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:52,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:23:52,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:23:52,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:23:52,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:52,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:52,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:52,352 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:52,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,357 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:52,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,365 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,365 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:52,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,374 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,374 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,376 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,377 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:52,382 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,383 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,386 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,388 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,389 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,391 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,391 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:52,392 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,402 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,413 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,423 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,433 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,453 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:52,453 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:52,478 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,480 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,481 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,482 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,483 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,486 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,487 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:52,488 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,507 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:52,507 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:52,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,536 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,543 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:52,544 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,563 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:52,563 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:23:52,590 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,592 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,596 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,600 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:52,601 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,620 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:52,621 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:52,646 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,650 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,651 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,654 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,655 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:52,656 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:52,656 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:52,677 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:52,677 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:52,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:52,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:52,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:23:52,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:52,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:52,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:52,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:52,849 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-02-28 10:23:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:53,686 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-02-28 10:23:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:53,693 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:53,694 INFO L225 Difference]: With dead ends: 209 [2019-02-28 10:23:53,694 INFO L226 Difference]: Without dead ends: 207 [2019-02-28 10:23:53,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-28 10:23:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-02-28 10:23:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-28 10:23:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-02-28 10:23:53,771 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-02-28 10:23:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:53,771 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-02-28 10:23:53,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-02-28 10:23:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:53,772 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:53,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:53,772 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:53,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-02-28 10:23:53,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:53,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:53,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:53,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:53,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:53,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:53,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:53,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:53,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:53,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:53,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:53,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:53,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:53,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:53,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:53,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:53,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:53,897 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:53,906 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:53,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,919 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:23:53,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,934 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:23:53,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:53,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,069 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:23:54,070 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:54,078 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:54,088 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:54,098 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:54,109 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:54,125 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:54,125 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:23:54,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,156 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,159 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,160 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:54,161 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:54,175 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:54,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:54,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,192 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,192 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,195 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,196 INFO L442 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 31 treesize of output 26 [2019-02-28 10:23:54,196 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:54,211 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:54,211 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:54,228 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:54,233 INFO L442 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 33 treesize of output 28 [2019-02-28 10:23:54,233 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:54,248 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:54,248 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:54,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:54,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:54,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:23:54,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:54,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:54,345 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-02-28 10:23:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:54,843 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-02-28 10:23:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:54,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:54,846 INFO L225 Difference]: With dead ends: 180 [2019-02-28 10:23:54,846 INFO L226 Difference]: Without dead ends: 173 [2019-02-28 10:23:54,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:23:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-28 10:23:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-02-28 10:23:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-28 10:23:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-02-28 10:23:54,933 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-02-28 10:23:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:54,933 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-02-28 10:23:54,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-02-28 10:23:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:54,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:54,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:54,934 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-02-28 10:23:54,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:54,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:54,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:55,577 WARN L181 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-28 10:23:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:55,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:55,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:55,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:55,657 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-28 10:23:55,658 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:55,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:55,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:55,659 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:23:55,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:55,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:55,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:55,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:55,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:55,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:55,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:55,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:55,677 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:55,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,679 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:55,681 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,682 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,684 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:55,687 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,688 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,689 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,691 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,691 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:55,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,698 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,705 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:55,706 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,716 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,726 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,737 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,747 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,766 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:55,766 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:55,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,797 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,798 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:55,798 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,818 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:55,818 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:55,838 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,840 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,840 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,845 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,846 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,848 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:55,849 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,868 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:55,868 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:55,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,893 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,895 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,896 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,902 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:55,902 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,920 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:55,921 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:55,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:55,957 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:55,957 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:55,981 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:55,981 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:23:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:56,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:56,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:56,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:23:56,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:56,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:56,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:56,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:56,741 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-02-28 10:23:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:57,571 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-02-28 10:23:57,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:23:57,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:23:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:57,573 INFO L225 Difference]: With dead ends: 189 [2019-02-28 10:23:57,573 INFO L226 Difference]: Without dead ends: 188 [2019-02-28 10:23:57,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-02-28 10:23:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-02-28 10:23:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-28 10:23:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-02-28 10:23:57,669 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-02-28 10:23:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:57,669 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-02-28 10:23:57,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-02-28 10:23:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:57,669 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:57,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:57,669 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-28 10:23:57,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:57,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:57,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:57,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:57,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:57,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:57,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:57,898 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:57,898 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-28 10:23:57,899 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:57,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:57,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:57,901 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:23:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:57,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:57,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:57,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:57,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:57,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:57,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:57,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:57,917 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:57,919 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,919 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:23:57,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,924 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:23:57,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,933 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:23:57,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:57,982 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:23:57,982 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:57,991 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,001 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,011 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,021 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,040 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,040 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:23:58,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,076 INFO L442 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 36 treesize of output 31 [2019-02-28 10:23:58,077 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,097 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:58,098 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:23:58,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,139 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,141 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:58,141 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,161 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:58,161 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:58,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,188 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,192 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,198 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,200 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:58,201 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,221 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:58,222 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:58,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,251 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,258 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:58,260 INFO L442 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 38 treesize of output 33 [2019-02-28 10:23:58,260 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:58,278 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:58,278 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:23:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:58,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:58,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:58,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:23:58,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:58,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:23:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:23:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:58,376 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-02-28 10:23:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:59,182 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-02-28 10:23:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:59,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-28 10:23:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:59,185 INFO L225 Difference]: With dead ends: 169 [2019-02-28 10:23:59,185 INFO L226 Difference]: Without dead ends: 168 [2019-02-28 10:23:59,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-02-28 10:23:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-02-28 10:23:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-28 10:23:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-02-28 10:23:59,291 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-02-28 10:23:59,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:59,291 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-02-28 10:23:59,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:23:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-02-28 10:23:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:59,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:59,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:59,292 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-28 10:23:59,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:59,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:59,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:59,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:59,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:59,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:59,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:59,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:59,390 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-28 10:23:59,390 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:59,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:59,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:59,393 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:59,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:59,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:59,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:59,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:59,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:59,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:23:59,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:59,416 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:23:59,429 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:23:59,487 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:23:59,513 INFO L442 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-02-28 10:23:59,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:59,543 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 27 treesize of output 35 [2019-02-28 10:23:59,544 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:59,553 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:59,563 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:59,573 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:59,583 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:59,595 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:59,595 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-02-28 10:23:59,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:59,620 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:23:59,620 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:59,626 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:59,627 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-02-28 10:23:59,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:59,638 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-02-28 10:23:59,639 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:59,645 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:23:59,646 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-28 10:23:59,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-02-28 10:23:59,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:59,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:59,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:59,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:59,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:59,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:59,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:59,698 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-02-28 10:23:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:59,996 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-02-28 10:23:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:59,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-28 10:23:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:59,999 INFO L225 Difference]: With dead ends: 159 [2019-02-28 10:23:59,999 INFO L226 Difference]: Without dead ends: 158 [2019-02-28 10:23:59,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:24:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-28 10:24:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-02-28 10:24:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-28 10:24:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-02-28 10:24:00,094 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-02-28 10:24:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:00,095 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-02-28 10:24:00,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:24:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-02-28 10:24:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:00,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:00,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:00,095 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:00,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-02-28 10:24:00,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:00,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:00,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:00,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:00,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:00,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:00,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:00,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:00,311 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-02-28 10:24:00,312 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:00,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:00,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:00,315 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-28 10:24:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:00,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:00,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:00,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:00,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:00,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:00,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:24:00,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:00,341 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:00,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,345 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:00,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,351 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,351 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:00,353 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,360 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,362 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,365 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:00,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,374 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,376 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,378 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,379 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,380 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,381 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,382 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:00,382 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,393 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,403 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,411 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,419 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,437 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,438 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:00,462 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,463 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,464 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,465 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,466 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,467 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,469 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,472 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:00,473 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,492 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:00,492 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:00,515 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,526 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:00,526 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,545 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:00,546 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:00,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,572 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,576 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,578 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,580 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:00,581 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,600 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:00,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:00,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,624 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,625 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,625 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,626 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,627 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,633 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:00,633 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,653 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:00,653 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:00,693 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,693 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,698 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,703 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:00,703 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:00,704 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:00,725 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:00,726 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:00,749 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:00,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:00,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-28 10:24:00,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:00,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:24:00,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:24:00,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:24:00,849 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-02-28 10:24:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:02,102 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-02-28 10:24:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:24:02,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-28 10:24:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:02,105 INFO L225 Difference]: With dead ends: 199 [2019-02-28 10:24:02,106 INFO L226 Difference]: Without dead ends: 198 [2019-02-28 10:24:02,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:24:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-28 10:24:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-02-28 10:24:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-28 10:24:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-02-28 10:24:02,202 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-02-28 10:24:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:02,202 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-02-28 10:24:02,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:24:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-02-28 10:24:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:02,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:02,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:02,203 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:02,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:02,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-02-28 10:24:02,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:02,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:02,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:02,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:02,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:02,337 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-28 10:24:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:02,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:02,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:02,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:02,412 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-02-28 10:24:02,415 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:02,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:02,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:02,417 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:24:02,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:02,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:02,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:02,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:02,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:02,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:24:02,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:02,435 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:02,446 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:02,447 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,456 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:24:02,458 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,459 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,460 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,469 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:24:02,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,476 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,477 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,488 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:24:02,489 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,497 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,507 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,517 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,527 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,544 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:02,544 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:24:02,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,585 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,587 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:02,587 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,602 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:02,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:24:02,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,624 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,625 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,626 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,628 INFO L442 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 33 treesize of output 28 [2019-02-28 10:24:02,628 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,643 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:02,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:24:02,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,667 INFO L442 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 33 treesize of output 28 [2019-02-28 10:24:02,668 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,683 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:02,683 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:24:02,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,706 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,708 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,709 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:02,709 INFO L442 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 35 treesize of output 30 [2019-02-28 10:24:02,710 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:02,722 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:02,723 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:24:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:02,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:02,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:02,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:24:02,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:02,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:24:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:24:02,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:24:02,813 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-02-28 10:24:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:03,552 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-02-28 10:24:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:24:03,553 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:24:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:03,555 INFO L225 Difference]: With dead ends: 181 [2019-02-28 10:24:03,555 INFO L226 Difference]: Without dead ends: 180 [2019-02-28 10:24:03,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:24:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-28 10:24:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-02-28 10:24:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-28 10:24:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-02-28 10:24:03,660 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-02-28 10:24:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:03,660 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-02-28 10:24:03,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:24:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-02-28 10:24:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:03,660 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:03,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:03,661 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-02-28 10:24:03,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:03,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:03,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:03,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:03,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:03,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:03,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:03,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:03,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:03,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:03,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:03,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:24:03,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:03,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:24:03,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:03,918 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:03,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,926 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:03,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,932 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:03,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,942 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:03,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,959 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:03,961 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:03,961 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:03,971 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:03,996 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,006 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,016 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,035 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,035 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:04,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,081 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,082 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,087 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:04,088 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,107 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:04,107 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:04,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,137 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,139 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,141 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,143 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:04,144 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,163 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:04,163 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:04,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,195 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,198 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,199 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:04,199 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,219 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:04,219 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:04,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,250 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,251 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,255 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,257 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:04,257 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,276 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:04,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:04,302 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,304 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,306 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,309 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,310 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,311 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,312 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:04,313 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:04,313 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:04,333 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:04,333 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:04,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:04,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:04,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-28 10:24:04,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:04,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:24:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:24:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:24:04,560 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-02-28 10:24:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:05,889 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-02-28 10:24:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:24:05,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-28 10:24:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:05,892 INFO L225 Difference]: With dead ends: 200 [2019-02-28 10:24:05,892 INFO L226 Difference]: Without dead ends: 199 [2019-02-28 10:24:05,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:24:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-28 10:24:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-02-28 10:24:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-28 10:24:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-02-28 10:24:05,985 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-02-28 10:24:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:05,985 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-02-28 10:24:05,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:24:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-02-28 10:24:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:05,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:05,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:05,986 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:05,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-02-28 10:24:05,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:05,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:05,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:06,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:06,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:06,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:06,136 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-28 10:24:06,136 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:06,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:06,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:06,139 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:24:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:06,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:06,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:06,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:06,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:06,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:06,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:24:06,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:06,156 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:06,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,162 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:06,165 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,167 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,169 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,169 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:06,171 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,177 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,179 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,183 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,183 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:06,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,195 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,205 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,206 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:06,207 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:06,217 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:06,227 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:06,237 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:06,247 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:06,265 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:06,265 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:06,290 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,291 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,292 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,293 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,294 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,296 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,298 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,300 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,301 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:06,301 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:06,320 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:06,320 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:06,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,343 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,344 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,350 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,351 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,352 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,353 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:06,353 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:06,373 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:06,373 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:06,393 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,394 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,395 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,396 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,398 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,399 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,400 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,401 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,402 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,403 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:06,404 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:06,404 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:06,423 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:06,423 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:06,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:06,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:06,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:24:06,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:06,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:06,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:06,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:06,499 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-02-28 10:24:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:07,048 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-02-28 10:24:07,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:24:07,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:24:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:07,050 INFO L225 Difference]: With dead ends: 160 [2019-02-28 10:24:07,050 INFO L226 Difference]: Without dead ends: 159 [2019-02-28 10:24:07,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:24:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-28 10:24:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-02-28 10:24:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-28 10:24:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-02-28 10:24:07,155 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-02-28 10:24:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:07,155 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-02-28 10:24:07,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-02-28 10:24:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:07,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:07,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:07,156 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-02-28 10:24:07,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:07,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:07,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:07,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:07,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:07,326 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-28 10:24:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:07,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:07,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:07,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:07,379 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-28 10:24:07,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:07,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:07,381 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:07,381 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:24:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:07,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:07,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:07,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:07,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:07,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:07,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:24:07,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:07,411 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:07,413 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,413 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:07,415 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,416 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,417 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,418 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:07,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,426 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:07,429 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,434 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,435 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,438 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,439 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,440 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:07,440 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,451 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,461 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,471 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,480 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,499 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:07,499 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:07,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,534 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:07,535 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,554 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:07,554 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:07,576 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,578 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,586 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:07,587 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,606 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:07,606 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:07,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,641 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:07,641 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,661 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:07,661 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:07,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,687 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,687 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,688 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,689 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,691 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,692 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,693 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:07,695 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:07,695 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:07,715 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:07,715 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:07,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:07,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:07,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:24:07,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:07,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:24:07,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:24:07,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:07,806 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-02-28 10:24:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:08,650 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-02-28 10:24:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:24:08,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-28 10:24:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:08,652 INFO L225 Difference]: With dead ends: 197 [2019-02-28 10:24:08,653 INFO L226 Difference]: Without dead ends: 196 [2019-02-28 10:24:08,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:24:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-02-28 10:24:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-02-28 10:24:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-02-28 10:24:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-02-28 10:24:08,759 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-02-28 10:24:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:08,759 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-02-28 10:24:08,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:24:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-02-28 10:24:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:08,760 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:08,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:08,760 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-02-28 10:24:08,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:08,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:08,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:08,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:08,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:08,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:08,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:08,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:08,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:08,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:08,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:08,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:08,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:08,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:24:08,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:08,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:24:08,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:08,947 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:08,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:08,951 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:08,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:08,959 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:08,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:08,961 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:09,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,048 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:09,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,056 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,058 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,059 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,060 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,061 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,062 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:09,062 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,072 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,083 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,093 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,103 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,122 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:09,122 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:09,149 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,149 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,150 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,152 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,153 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,154 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,156 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,158 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:09,159 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,178 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:09,178 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:09,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,205 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,207 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,208 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,209 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:09,209 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,229 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:09,229 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:09,251 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,251 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,253 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,255 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,257 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,258 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,260 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,260 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:09,261 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,280 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:09,281 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:09,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,306 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,308 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,310 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,311 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,312 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:09,314 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:09,314 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:09,349 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:09,349 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:09,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:09,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:09,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:24:09,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:09,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:24:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:24:09,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:24:09,461 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-02-28 10:24:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:10,329 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-02-28 10:24:10,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:24:10,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:24:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:10,332 INFO L225 Difference]: With dead ends: 195 [2019-02-28 10:24:10,332 INFO L226 Difference]: Without dead ends: 189 [2019-02-28 10:24:10,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:24:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-28 10:24:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-02-28 10:24:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-28 10:24:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-02-28 10:24:10,440 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-02-28 10:24:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:10,440 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-02-28 10:24:10,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:24:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-02-28 10:24:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:10,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:10,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:10,441 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-02-28 10:24:10,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:10,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:10,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:10,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:10,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:10,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:10,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:10,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:10,567 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-28 10:24:10,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:10,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:10,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:10,571 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:24:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:10,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:10,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:10,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:10,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:10,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:10,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:24:10,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:10,589 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:10,604 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:10,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,626 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:24:10,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,648 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:24:10,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,650 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,651 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,653 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,654 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,664 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:24:10,664 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:10,674 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:10,685 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:10,695 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:10,705 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:10,721 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:10,721 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:24:10,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,755 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,757 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:10,758 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:10,772 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:10,773 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:24:10,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,792 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,796 INFO L442 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 33 treesize of output 28 [2019-02-28 10:24:10,796 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:10,818 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:10,818 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:24:10,838 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,840 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:10,843 INFO L442 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 35 treesize of output 30 [2019-02-28 10:24:10,844 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:10,862 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:10,863 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:24:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:10,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:10,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:10,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:24:10,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:10,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:10,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:10,944 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-02-28 10:24:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:11,460 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-02-28 10:24:11,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:24:11,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:24:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:11,463 INFO L225 Difference]: With dead ends: 157 [2019-02-28 10:24:11,463 INFO L226 Difference]: Without dead ends: 156 [2019-02-28 10:24:11,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:24:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-28 10:24:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-02-28 10:24:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-28 10:24:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-02-28 10:24:11,579 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-02-28 10:24:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:11,579 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-02-28 10:24:11,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-02-28 10:24:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:11,580 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:11,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:11,580 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-02-28 10:24:11,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:11,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:11,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:11,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:11,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:11,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:11,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:11,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:11,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:11,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:11,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:11,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:11,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:24:11,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:11,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:24:11,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:11,788 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:11,800 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:11,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,820 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:24:11,822 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,835 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:24:11,837 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,840 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,841 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,854 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:24:11,854 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:11,864 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:11,874 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:11,884 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:11,894 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:11,911 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:11,911 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:24:11,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,955 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:11,955 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:11,970 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:11,970 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:24:11,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:11,998 INFO L442 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 33 treesize of output 28 [2019-02-28 10:24:11,998 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:12,011 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:12,012 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-02-28 10:24:12,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,043 INFO L442 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 35 treesize of output 30 [2019-02-28 10:24:12,043 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:12,056 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:12,056 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-28 10:24:12,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,081 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:12,082 INFO L442 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 35 treesize of output 30 [2019-02-28 10:24:12,082 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:12,097 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:12,097 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:24:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:12,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:12,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:12,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:24:12,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:12,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:24:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:24:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:24:12,190 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-02-28 10:24:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:12,848 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-02-28 10:24:12,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:24:12,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:24:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:12,850 INFO L225 Difference]: With dead ends: 178 [2019-02-28 10:24:12,850 INFO L226 Difference]: Without dead ends: 177 [2019-02-28 10:24:12,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:24:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-28 10:24:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-02-28 10:24:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-28 10:24:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-02-28 10:24:12,951 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-02-28 10:24:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:12,951 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-02-28 10:24:12,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:24:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-02-28 10:24:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:12,951 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:12,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:12,952 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-02-28 10:24:12,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:12,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:12,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:13,146 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-28 10:24:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:13,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:13,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:13,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:13,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:13,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:13,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:13,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:13,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:24:13,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:13,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:24:13,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:13,270 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:13,276 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,276 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:13,278 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,280 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,282 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:13,312 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,315 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,315 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,316 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,317 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:13,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,320 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,322 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,323 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,328 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,329 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,330 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,331 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:13,331 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,341 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,351 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,361 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,372 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,390 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:13,391 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:13,414 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,415 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,416 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,417 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,423 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,425 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:13,425 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,444 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:13,445 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:13,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,469 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,476 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,477 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:13,477 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,494 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:13,495 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:13,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,528 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:13,528 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,548 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:13,548 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:13,576 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,578 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,578 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:13,585 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:13,585 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:13,604 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:13,605 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:13,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:13,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:13,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:24:13,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:13,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:24:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:24:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:13,701 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-02-28 10:24:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:14,644 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-02-28 10:24:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:24:14,644 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:24:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:14,647 INFO L225 Difference]: With dead ends: 204 [2019-02-28 10:24:14,647 INFO L226 Difference]: Without dead ends: 203 [2019-02-28 10:24:14,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:24:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-28 10:24:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-02-28 10:24:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-28 10:24:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-02-28 10:24:14,754 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-02-28 10:24:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:14,754 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-02-28 10:24:14,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:24:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-02-28 10:24:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:14,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:14,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:14,755 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:14,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-02-28 10:24:14,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:14,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:14,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:14,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:14,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:14,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:14,864 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-28 10:24:14,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:14,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:14,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:14,867 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:24:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:14,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:14,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:14,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:14,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:14,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:14,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:24:14,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:14,888 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:14,897 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:14,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,908 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:24:14,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,922 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:24:14,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:14,939 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:24:14,940 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:14,951 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:14,961 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:14,972 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:14,982 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:14,999 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:14,999 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:24:15,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,040 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:15,040 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:15,055 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:15,055 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:24:15,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,079 INFO L442 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 33 treesize of output 28 [2019-02-28 10:24:15,080 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:15,094 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:15,094 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:24:15,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,115 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,117 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,118 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,120 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:15,120 INFO L442 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 35 treesize of output 30 [2019-02-28 10:24:15,121 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:15,135 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:15,136 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:24:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:15,157 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:15,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:15,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:24:15,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:15,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:15,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:24:15,295 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-02-28 10:24:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:15,885 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-02-28 10:24:15,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:24:15,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:24:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:15,888 INFO L225 Difference]: With dead ends: 178 [2019-02-28 10:24:15,888 INFO L226 Difference]: Without dead ends: 177 [2019-02-28 10:24:15,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-28 10:24:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-02-28 10:24:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:24:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-02-28 10:24:15,984 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-02-28 10:24:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:15,984 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-02-28 10:24:15,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-02-28 10:24:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:15,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:15,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:15,985 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:15,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-02-28 10:24:15,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:15,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:15,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:15,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:15,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:16,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:16,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:16,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:16,053 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-02-28 10:24:16,054 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:16,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:16,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:16,056 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:24:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:16,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:16,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:16,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:16,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:16,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:16,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:24:16,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:16,071 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:16,085 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:16,108 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:24:16,110 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,125 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:24:16,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,149 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:24:16,149 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:16,158 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:16,168 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:16,178 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:16,188 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:16,203 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:16,203 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-02-28 10:24:16,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,233 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:16,234 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:16,244 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:16,244 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:24:16,261 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,261 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,262 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,263 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:24:16,263 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:16,273 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:16,273 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:24:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:16,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:16,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:16,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:24:16,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:16,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:24:16,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:24:16,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:24:16,327 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-02-28 10:24:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:16,705 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-02-28 10:24:16,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:24:16,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-28 10:24:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:16,707 INFO L225 Difference]: With dead ends: 134 [2019-02-28 10:24:16,707 INFO L226 Difference]: Without dead ends: 133 [2019-02-28 10:24:16,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:24:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-28 10:24:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-02-28 10:24:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:24:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-02-28 10:24:16,808 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-02-28 10:24:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:16,808 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-02-28 10:24:16,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:24:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-02-28 10:24:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:16,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:16,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:16,809 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:16,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:16,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-02-28 10:24:16,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:16,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:16,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:16,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:16,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:16,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:16,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:16,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:16,943 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-02-28 10:24:16,944 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:16,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:16,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:16,946 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:24:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:16,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:16,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:16,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:16,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:16,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:16,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:24:16,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:16,963 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:16,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,967 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:16,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,976 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,979 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:16,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,991 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,991 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:16,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:16,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,000 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,003 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,005 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:17,005 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:17,016 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:17,026 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:17,036 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:17,047 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:17,066 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:17,066 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:17,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,095 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,098 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:17,098 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:17,122 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:17,123 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:17,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,188 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,192 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,196 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:17,197 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:17,217 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:17,217 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:17,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:17,250 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:17,250 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:17,270 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:17,270 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:17,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:17,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:17,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:24:17,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:17,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:17,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:17,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:17,346 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-02-28 10:24:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:17,929 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-02-28 10:24:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:24:17,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:24:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:17,931 INFO L225 Difference]: With dead ends: 143 [2019-02-28 10:24:17,931 INFO L226 Difference]: Without dead ends: 142 [2019-02-28 10:24:17,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 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-02-28 10:24:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-28 10:24:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-02-28 10:24:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:24:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-02-28 10:24:18,032 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-02-28 10:24:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:18,033 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-02-28 10:24:18,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-02-28 10:24:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:18,033 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:18,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:18,034 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-02-28 10:24:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:18,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:18,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:18,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:18,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:18,245 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-02-28 10:24:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:18,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:18,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:18,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:18,277 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-02-28 10:24:18,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:18,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:18,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:18,282 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:24:18,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:18,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:18,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:18,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:18,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:18,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:18,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:24:18,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:18,340 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:18,502 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:18,536 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:24:18,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,559 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:24:18,562 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,563 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,563 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,594 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:24:18,594 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:18,602 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:18,612 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:18,622 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:18,632 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:18,646 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:18,646 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-28 10:24:18,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,674 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:18,674 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:18,684 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:18,684 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:24:18,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,702 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:18,702 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:18,712 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:18,713 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:24:18,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,729 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:18,729 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:24:18,729 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:18,738 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:18,738 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:24:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:18,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:18,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:18,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:24:18,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:18,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:18,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:18,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:24:18,798 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-02-28 10:24:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:19,279 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-02-28 10:24:19,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:24:19,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:24:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:19,282 INFO L225 Difference]: With dead ends: 151 [2019-02-28 10:24:19,282 INFO L226 Difference]: Without dead ends: 150 [2019-02-28 10:24:19,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:24:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-28 10:24:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-02-28 10:24:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-28 10:24:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-02-28 10:24:19,394 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-02-28 10:24:19,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:19,394 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-02-28 10:24:19,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:19,394 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-02-28 10:24:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:19,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:19,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:19,395 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:19,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-02-28 10:24:19,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:19,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:19,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:19,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:19,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:19,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:19,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:19,571 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-28 10:24:19,572 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:19,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:19,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:19,575 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:24:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:19,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:19,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:19,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:19,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:19,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:19,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:24:19,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:19,599 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:19,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,601 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:19,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,604 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,605 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:19,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,612 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,614 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:19,654 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,739 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,739 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,742 INFO L289 Elim1Store]: Index analysis took 108 ms [2019-02-28 10:24:19,742 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:19,743 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:19,753 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:19,763 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:19,773 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:19,783 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:19,802 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:19,802 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:19,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,828 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,829 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,831 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,832 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,835 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:19,835 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:19,854 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:19,855 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:19,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,887 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:19,887 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:19,906 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:19,906 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:19,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,942 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:19,942 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:19,961 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:19,962 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:19,988 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:19,999 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:19,999 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:20,019 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:20,019 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:20,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:20,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:20,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:24:20,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:20,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:24:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:24:20,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:20,104 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-02-28 10:24:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:20,944 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-02-28 10:24:20,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:24:20,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:24:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:20,947 INFO L225 Difference]: With dead ends: 215 [2019-02-28 10:24:20,947 INFO L226 Difference]: Without dead ends: 214 [2019-02-28 10:24:20,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:24:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-28 10:24:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-02-28 10:24:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-02-28 10:24:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-02-28 10:24:21,083 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-02-28 10:24:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:21,083 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-02-28 10:24:21,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:24:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-02-28 10:24:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:21,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:21,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:21,084 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-28 10:24:21,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:21,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:21,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:21,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:21,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:21,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:21,103 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-28 10:24:21,104 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:21,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:21,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:21,106 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:24:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:21,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:21,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:21,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:21,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:21,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:21,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:24:21,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:21,134 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:21,146 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:21,166 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:24:21,191 INFO L442 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-02-28 10:24:21,479 INFO L442 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-02-28 10:24:21,480 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:21,488 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:21,498 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:21,507 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:21,517 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:21,526 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:21,526 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-28 10:24:21,531 INFO L442 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 16 treesize of output 11 [2019-02-28 10:24:21,531 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:21,532 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:21,532 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-28 10:24:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:21,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:21,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:24:21,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:24:21,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:24:21,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:24:21,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:24:21,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:24:21,562 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-02-28 10:24:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:21,897 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-02-28 10:24:21,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:24:21,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-28 10:24:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:21,900 INFO L225 Difference]: With dead ends: 280 [2019-02-28 10:24:21,900 INFO L226 Difference]: Without dead ends: 275 [2019-02-28 10:24:21,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:24:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-02-28 10:24:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-02-28 10:24:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-02-28 10:24:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-02-28 10:24:22,151 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-02-28 10:24:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:22,151 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-02-28 10:24:22,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:24:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-02-28 10:24:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:22,152 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:22,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:22,152 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-02-28 10:24:22,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:22,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:22,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:22,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:22,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:22,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:22,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:22,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:22,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:22,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:22,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:22,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:24:22,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:22,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:24:22,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:22,320 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:22,322 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,322 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:22,324 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,326 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,327 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:22,329 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,331 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,332 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,334 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,335 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,336 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:22,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,341 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,344 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,348 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,349 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:22,349 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,359 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,369 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,380 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,390 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,408 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:22,409 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:22,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,433 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,434 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,438 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,439 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,440 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,441 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:22,441 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,460 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:22,461 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:22,483 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,486 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,487 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,488 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,493 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:22,493 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,511 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:22,511 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:22,537 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,543 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,546 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:22,547 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,564 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:22,564 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:22,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,590 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,592 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,596 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:22,598 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:22,599 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:22,618 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:22,619 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:22,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:22,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:22,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:24:22,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:22,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:24:22,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:24:22,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:22,712 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-02-28 10:24:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:23,730 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-02-28 10:24:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:24:23,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-28 10:24:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:23,734 INFO L225 Difference]: With dead ends: 329 [2019-02-28 10:24:23,734 INFO L226 Difference]: Without dead ends: 328 [2019-02-28 10:24:23,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:24:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-02-28 10:24:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-02-28 10:24:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-28 10:24:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-02-28 10:24:24,019 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-02-28 10:24:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:24,019 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-02-28 10:24:24,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:24:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-02-28 10:24:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:24,020 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:24,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:24,021 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-28 10:24:24,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:24,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:24,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:24,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:24,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:24,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:24,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:24,147 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:24,147 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-28 10:24:24,148 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:24,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:24,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:24,150 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:24:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:24,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:24,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:24,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:24,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:24,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:24:24,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:24,199 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:24,240 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:24,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,252 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:24:24,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,255 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,266 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:24:24,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,271 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,272 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,273 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,274 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,284 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:24:24,285 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:24,293 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:24,303 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:24,313 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:24,323 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:24,340 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:24,340 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:24:24,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,372 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,374 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,376 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,377 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:24,377 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:24,392 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:24,392 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:24:24,411 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,412 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,413 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,414 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,415 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,416 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:24,417 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:24,418 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:24,432 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:24,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:24:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:24,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:24,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:24,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:24:24,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:24,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:24:24,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:24:24,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:24:24,499 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-02-28 10:24:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:25,061 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-02-28 10:24:25,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:24:25,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-28 10:24:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:25,064 INFO L225 Difference]: With dead ends: 290 [2019-02-28 10:24:25,064 INFO L226 Difference]: Without dead ends: 286 [2019-02-28 10:24:25,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:24:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-28 10:24:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-02-28 10:24:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-28 10:24:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-02-28 10:24:25,335 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-02-28 10:24:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:25,336 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-02-28 10:24:25,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:24:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-02-28 10:24:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:25,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:25,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:25,337 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-02-28 10:24:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:25,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:25,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:25,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:25,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:25,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:25,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:25,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:25,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:25,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:25,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:24:25,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:25,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:24:25,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:25,455 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:25,467 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:25,489 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:24:25,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,509 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:24:25,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,532 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:24:25,533 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:25,543 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:25,553 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:25,563 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:25,573 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:25,587 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:25,587 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-28 10:24:25,615 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,616 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,617 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,618 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:25,618 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:25,628 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:25,628 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:24:25,646 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,648 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:25,648 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:25,658 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:25,658 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:24:25,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,677 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:25,677 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:25,678 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:25,688 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:25,688 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:24:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:25,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:25,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:25,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:24:25,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:25,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:25,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:25,761 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-02-28 10:24:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:26,368 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-02-28 10:24:26,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:24:26,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:24:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:26,373 INFO L225 Difference]: With dead ends: 307 [2019-02-28 10:24:26,373 INFO L226 Difference]: Without dead ends: 302 [2019-02-28 10:24:26,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-28 10:24:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-02-28 10:24:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-02-28 10:24:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-02-28 10:24:26,631 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-02-28 10:24:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:26,631 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-02-28 10:24:26,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-02-28 10:24:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:26,631 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:26,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:26,632 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-02-28 10:24:26,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:26,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:26,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:26,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:26,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:26,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:26,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:26,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:26,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:26,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:24:26,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:24:26,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:24:26,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:26,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:24:26,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:26,883 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:26,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,890 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:26,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,896 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,896 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:26,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,904 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,909 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:26,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,917 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:26,922 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:26,923 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:26,933 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:26,943 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:26,953 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:26,963 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:26,982 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:26,982 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:27,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,019 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:27,020 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:27,039 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:27,039 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:27,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,076 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:27,077 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:27,096 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:27,096 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:27,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,135 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:27,136 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:27,155 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:27,155 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:27,179 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,180 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,182 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,183 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,184 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,185 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,188 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,189 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:27,190 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:27,209 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:27,209 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:27,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:27,248 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:27,249 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:27,268 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:27,269 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:27,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:27,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:27,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-28 10:24:27,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:27,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:24:27,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:24:27,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:24:27,414 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-02-28 10:24:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:28,692 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-02-28 10:24:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:24:28,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-28 10:24:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:28,696 INFO L225 Difference]: With dead ends: 284 [2019-02-28 10:24:28,696 INFO L226 Difference]: Without dead ends: 279 [2019-02-28 10:24:28,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:24:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-28 10:24:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-02-28 10:24:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-28 10:24:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-02-28 10:24:28,950 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-02-28 10:24:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:28,950 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-02-28 10:24:28,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:24:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-02-28 10:24:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:28,951 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:28,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:28,951 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-02-28 10:24:28,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:28,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:28,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:28,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:28,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:29,247 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 10:24:29,408 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-02-28 10:24:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:29,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:29,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:29,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:29,547 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-28 10:24:29,548 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:29,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:29,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:29,550 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:24:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:29,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:29,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:29,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:29,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:29,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:29,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:24:29,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:29,575 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:29,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,577 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:29,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,585 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:29,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,587 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,592 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,592 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:29,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,596 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,603 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:29,603 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:29,614 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:29,624 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:29,634 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:29,644 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:29,663 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:29,663 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:29,681 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,682 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,682 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,684 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,685 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,687 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,688 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,689 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,690 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:29,691 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:29,710 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:29,710 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:29,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,729 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,730 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,732 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,733 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,734 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,735 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,736 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,737 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:29,739 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:29,739 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:29,759 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:29,759 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:29,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:29,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:29,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:24:29,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:29,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:24:29,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:24:29,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:24:29,808 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-02-28 10:24:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:30,336 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-02-28 10:24:30,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:24:30,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-28 10:24:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:30,339 INFO L225 Difference]: With dead ends: 230 [2019-02-28 10:24:30,340 INFO L226 Difference]: Without dead ends: 223 [2019-02-28 10:24:30,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:24:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-02-28 10:24:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-02-28 10:24:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-28 10:24:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-02-28 10:24:30,602 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-02-28 10:24:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:30,602 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-02-28 10:24:30,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:24:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-02-28 10:24:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:30,603 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:30,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:30,603 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:30,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-02-28 10:24:30,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:30,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:30,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:30,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:30,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:30,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:30,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:30,721 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:30,722 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-02-28 10:24:30,722 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:30,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:30,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:30,724 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:24:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:30,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:30,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:30,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:30,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:30,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:30,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:24:30,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:30,751 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:30,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,757 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:30,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,763 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:30,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,769 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,771 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,773 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:30,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,779 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,781 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,783 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,786 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:30,787 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:30,797 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:30,807 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:30,817 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:30,827 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:30,846 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:30,846 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:30,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,887 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:30,887 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:30,906 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:30,907 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:30,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,937 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:30,937 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:30,957 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:30,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:30,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,982 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:30,987 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:30,987 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:31,007 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:31,007 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:31,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:31,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:31,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-28 10:24:31,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:31,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:24:31,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:24:31,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:24:31,064 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-02-28 10:24:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:31,728 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-02-28 10:24:31,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:24:31,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-28 10:24:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:31,731 INFO L225 Difference]: With dead ends: 254 [2019-02-28 10:24:31,731 INFO L226 Difference]: Without dead ends: 253 [2019-02-28 10:24:31,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-02-28 10:24:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-02-28 10:24:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-28 10:24:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-02-28 10:24:32,016 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-02-28 10:24:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:32,016 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-02-28 10:24:32,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:24:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-02-28 10:24:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:32,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:32,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:32,017 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:32,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-02-28 10:24:32,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:32,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:32,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:32,399 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-28 10:24:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:32,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:32,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:32,409 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:32,409 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-28 10:24:32,410 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:32,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:32,412 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:32,412 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:24:32,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:32,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:32,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:32,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:32,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:32,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:32,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:24:32,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:32,430 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:32,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,432 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:32,435 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,437 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:32,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,457 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,459 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,459 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,460 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,461 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,461 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:32,463 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,464 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,465 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,467 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,469 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,474 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:32,474 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:32,485 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:32,495 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:32,505 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:32,515 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:32,534 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:32,534 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:32,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,556 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,557 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,558 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,559 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,560 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,562 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,562 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:32,563 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:32,582 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:32,582 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:32,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,604 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,606 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:32,610 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:32,610 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:32,628 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:32,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:32,649 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:32,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:32,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:24:32,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:32,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:24:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:24:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:24:32,684 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-02-28 10:24:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:33,148 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-02-28 10:24:33,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:24:33,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-28 10:24:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:33,150 INFO L225 Difference]: With dead ends: 223 [2019-02-28 10:24:33,150 INFO L226 Difference]: Without dead ends: 216 [2019-02-28 10:24:33,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 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-02-28 10:24:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-28 10:24:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-02-28 10:24:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-28 10:24:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-02-28 10:24:33,429 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-02-28 10:24:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:33,429 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-02-28 10:24:33,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:24:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-02-28 10:24:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:33,430 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:33,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:33,430 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-02-28 10:24:33,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:33,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:33,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:33,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:33,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:33,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:33,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:33,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:33,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:33,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:33,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:33,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:24:33,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:24:33,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:24:33,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:33,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:24:33,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:33,688 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:33,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,691 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:33,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,697 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:33,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,706 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,707 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:33,710 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,712 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,713 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,714 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,716 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,717 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,724 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:33,725 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:33,734 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:33,745 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:33,755 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:33,765 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:33,784 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:33,784 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:33,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,820 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:33,820 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:33,839 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:33,839 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:33,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,866 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,868 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,869 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,871 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,872 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,873 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,875 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:33,875 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:33,894 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:33,895 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:33,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,950 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:33,950 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:33,969 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:33,970 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:33,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:33,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:34,000 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:34,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:34,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:34,003 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:34,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:34,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:34,006 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:34,007 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:34,026 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:34,027 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:34,055 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:34,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:34,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:24:34,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:34,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:24:34,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:24:34,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:24:34,139 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-02-28 10:24:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:35,218 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-02-28 10:24:35,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:24:35,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:24:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:35,222 INFO L225 Difference]: With dead ends: 285 [2019-02-28 10:24:35,222 INFO L226 Difference]: Without dead ends: 279 [2019-02-28 10:24:35,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:24:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-28 10:24:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-02-28 10:24:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-28 10:24:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-02-28 10:24:35,484 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-02-28 10:24:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:35,484 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-02-28 10:24:35,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:24:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-02-28 10:24:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:35,485 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:35,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:35,485 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-02-28 10:24:35,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:35,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:35,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:35,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:35,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:35,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:35,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:35,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:35,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:24:35,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:35,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:35,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:24:35,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:35,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:24:35,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:35,622 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:35,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,628 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:35,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,634 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:35,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,643 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,645 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,649 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:35,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,654 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,659 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,668 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,669 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:35,669 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:35,679 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:35,689 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:35,700 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:35,710 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:35,728 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:35,729 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:35,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,754 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,755 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,758 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,760 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,762 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:35,762 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:35,782 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:35,782 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:35,806 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,806 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,816 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:35,816 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:35,834 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:35,834 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:24:35,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:35,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:36,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:36,028 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:36,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:36,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:36,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:36,096 INFO L289 Elim1Store]: Index analysis took 224 ms [2019-02-28 10:24:36,097 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:36,098 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:36,294 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:36,295 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:36,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:36,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:36,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:24:36,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:36,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:36,370 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-02-28 10:24:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:37,138 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-02-28 10:24:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:24:37,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:24:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:37,142 INFO L225 Difference]: With dead ends: 252 [2019-02-28 10:24:37,142 INFO L226 Difference]: Without dead ends: 247 [2019-02-28 10:24:37,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-02-28 10:24:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-02-28 10:24:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-28 10:24:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-02-28 10:24:37,400 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-02-28 10:24:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-02-28 10:24:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-02-28 10:24:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:37,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:37,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:37,401 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-28 10:24:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:37,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:37,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:37,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:37,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:37,494 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:37,494 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-28 10:24:37,495 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:37,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:37,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:37,496 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:24:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:37,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:37,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:37,497 INFO 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-02-28 10:24:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:37,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:37,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:24:37,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:37,513 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:37,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,519 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:37,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,525 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:37,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,536 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,539 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:37,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,543 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,551 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,551 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:37,552 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:37,562 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:37,572 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:37,582 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:37,592 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:37,611 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:37,611 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:37,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,640 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:37,641 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:37,660 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:37,660 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:37,677 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,681 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,684 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,685 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:37,687 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:37,687 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:37,706 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:37,707 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:37,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:37,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:37,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:24:37,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:37,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:24:37,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:24:37,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:24:37,764 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-02-28 10:24:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:38,250 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-02-28 10:24:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:24:38,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-28 10:24:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:38,253 INFO L225 Difference]: With dead ends: 194 [2019-02-28 10:24:38,253 INFO L226 Difference]: Without dead ends: 193 [2019-02-28 10:24:38,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:24:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-28 10:24:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-02-28 10:24:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-28 10:24:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-02-28 10:24:38,508 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-02-28 10:24:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:38,509 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-02-28 10:24:38,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:24:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-02-28 10:24:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:38,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:38,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:38,509 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:38,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-02-28 10:24:38,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:38,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:38,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:38,933 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-28 10:24:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:39,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:39,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:39,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:39,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:39,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:39,003 INFO 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-02-28 10:24:39,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:39,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:39,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:24:39,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:39,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:24:39,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:39,022 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:39,042 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:39,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,056 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:24:39,059 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,060 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,061 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,071 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:24:39,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,089 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:24:39,090 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:39,098 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:39,108 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:39,118 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:39,128 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:39,144 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:39,145 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:24:39,207 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,208 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,209 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,209 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,210 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,211 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,211 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:39,212 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:39,226 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:39,226 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:24:39,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,251 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,253 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,253 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:39,254 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:39,268 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:39,269 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:24:39,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,288 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,289 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,289 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,290 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,291 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:39,292 INFO L442 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 33 treesize of output 28 [2019-02-28 10:24:39,292 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:39,307 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:39,307 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:24:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:39,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:39,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:39,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:24:39,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:39,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:39,377 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-02-28 10:24:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:40,224 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-02-28 10:24:40,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:24:40,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:24:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:40,226 INFO L225 Difference]: With dead ends: 265 [2019-02-28 10:24:40,226 INFO L226 Difference]: Without dead ends: 264 [2019-02-28 10:24:40,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-28 10:24:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-02-28 10:24:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-28 10:24:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-02-28 10:24:40,547 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-02-28 10:24:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:40,547 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-02-28 10:24:40,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-02-28 10:24:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:40,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:40,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:40,548 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:40,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:40,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-02-28 10:24:40,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:40,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:40,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:40,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:40,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:40,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:40,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:40,614 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:40,614 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-28 10:24:40,615 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:40,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:40,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:40,617 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:24:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:40,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:40,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:40,618 INFO 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-02-28 10:24:40,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:40,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:40,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:24:40,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:40,654 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:40,662 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:40,677 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:24:40,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,696 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:24:40,698 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,719 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:24:40,720 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:40,730 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:40,740 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:40,750 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:40,759 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:40,773 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:40,774 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-28 10:24:40,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,801 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,802 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:40,802 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:40,812 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:40,813 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:24:40,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,828 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:40,828 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:40,828 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:40,838 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:40,838 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-28 10:24:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:40,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:40,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:40,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:24:40,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:40,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:24:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:24:40,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:24:40,893 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-02-28 10:24:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:41,386 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-02-28 10:24:41,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:24:41,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-28 10:24:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:41,388 INFO L225 Difference]: With dead ends: 210 [2019-02-28 10:24:41,389 INFO L226 Difference]: Without dead ends: 203 [2019-02-28 10:24:41,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:24:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-28 10:24:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-02-28 10:24:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-28 10:24:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-02-28 10:24:41,704 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-02-28 10:24:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:41,705 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-02-28 10:24:41,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:24:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-02-28 10:24:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:24:41,705 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:41,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:41,705 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-02-28 10:24:41,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:41,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:41,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:41,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:41,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:41,809 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:24:41,809 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-02-28 10:24:41,810 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:41,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:41,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:41,811 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:24:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:41,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:41,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:41,812 INFO 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-02-28 10:24:41,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:41,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:41,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:24:41,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:41,829 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:41,841 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:41,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,854 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:24:41,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,869 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:24:41,872 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,872 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,873 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,886 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:24:41,887 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:41,895 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:41,905 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:41,915 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:41,925 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:41,942 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:41,942 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:24:41,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,976 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:41,982 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:41,982 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:41,996 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:41,996 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:24:42,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:42,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:42,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:42,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:42,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:42,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:42,020 INFO L442 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 31 treesize of output 26 [2019-02-28 10:24:42,021 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:42,035 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:42,035 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:24:42,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-02-28 10:24:42,055 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:42,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:42,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:24:42,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:42,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:24:42,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:24:42,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:24:42,091 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-02-28 10:24:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:42,641 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-02-28 10:24:42,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:24:42,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-28 10:24:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:42,642 INFO L225 Difference]: With dead ends: 216 [2019-02-28 10:24:42,642 INFO L226 Difference]: Without dead ends: 212 [2019-02-28 10:24:42,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:24:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-28 10:24:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-02-28 10:24:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-02-28 10:24:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-02-28 10:24:42,978 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-02-28 10:24:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:42,979 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-02-28 10:24:42,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:24:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-02-28 10:24:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:24:42,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:42,979 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:42,979 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:42,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:42,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-02-28 10:24:42,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:42,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:42,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:43,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:43,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:43,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:43,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:43,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:43,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:24:43,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:43,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:43,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:24:43,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:43,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:24:43,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:43,079 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:43,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,084 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:43,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,094 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:43,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,103 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,109 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,109 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:43,111 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,115 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,117 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,118 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,119 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,121 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,121 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:43,121 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:43,132 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:43,142 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:43,152 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:43,162 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:43,181 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:43,181 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:43,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,203 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,205 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,207 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:43,208 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:43,227 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:43,227 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:43,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,250 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,251 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,253 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,255 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:43,255 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:43,275 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:43,275 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:43,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,296 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,298 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,300 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,301 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,302 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,304 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:43,306 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:43,307 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:43,326 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:43,326 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:43,347 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:43,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:43,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:24:43,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:43,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:43,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:43,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:24:43,387 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-02-28 10:24:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:44,409 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-02-28 10:24:44,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:24:44,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-28 10:24:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:44,412 INFO L225 Difference]: With dead ends: 401 [2019-02-28 10:24:44,412 INFO L226 Difference]: Without dead ends: 397 [2019-02-28 10:24:44,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-02-28 10:24:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-02-28 10:24:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-02-28 10:24:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-02-28 10:24:45,015 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-02-28 10:24:45,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:45,015 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-02-28 10:24:45,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-02-28 10:24:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:24:45,016 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:45,016 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:45,017 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:45,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-02-28 10:24:45,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:45,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:45,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:24:45,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:24:45,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:24:45,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:24:45,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:24:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:24:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:24:45,069 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-02-28 10:24:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:45,668 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-02-28 10:24:45,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:24:45,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-02-28 10:24:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:45,670 INFO L225 Difference]: With dead ends: 347 [2019-02-28 10:24:45,670 INFO L226 Difference]: Without dead ends: 342 [2019-02-28 10:24:45,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:24:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-28 10:24:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-02-28 10:24:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-02-28 10:24:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-02-28 10:24:46,280 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-02-28 10:24:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:46,280 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-02-28 10:24:46,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:24:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-02-28 10:24:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:24:46,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:46,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:46,281 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:46,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:46,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-02-28 10:24:46,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:46,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:46,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:46,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:46,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:46,539 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-02-28 10:24:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:46,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:46,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:46,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:24:46,650 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-28 10:24:46,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:46,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:46,653 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:46,653 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-28 10:24:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:46,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:46,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:46,654 INFO 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-02-28 10:24:46,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:46,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:46,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:24:46,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:46,670 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:46,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,672 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:46,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,684 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,684 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:46,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,687 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,688 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,689 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,692 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,692 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:46,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,698 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,703 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,706 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:46,706 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,717 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,727 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,735 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,745 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,764 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,765 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:46,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,797 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,798 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:46,798 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,817 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:46,818 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:46,841 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,845 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,846 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,850 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,850 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:46,851 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,870 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:46,871 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:46,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,895 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,896 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,903 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,904 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:46,905 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,934 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:46,934 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:46,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,959 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:46,966 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:46,967 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:46,986 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:46,987 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:47,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,020 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:47,022 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:47,023 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:47,042 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:47,042 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:47,065 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:47,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:47,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-28 10:24:47,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:47,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:24:47,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:24:47,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:24:47,149 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-02-28 10:24:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:48,811 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-02-28 10:24:48,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:24:48,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-28 10:24:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:48,814 INFO L225 Difference]: With dead ends: 471 [2019-02-28 10:24:48,814 INFO L226 Difference]: Without dead ends: 470 [2019-02-28 10:24:48,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:24:48,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-02-28 10:24:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-02-28 10:24:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-02-28 10:24:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-02-28 10:24:49,462 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-02-28 10:24:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:49,462 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-02-28 10:24:49,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:24:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-02-28 10:24:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:24:49,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:49,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:49,463 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-02-28 10:24:49,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:49,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:49,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:49,643 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2019-02-28 10:24:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:49,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:49,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:49,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:49,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:49,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:49,760 INFO 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-02-28 10:24:49,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:24:49,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:24:49,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:24:49,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:49,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:24:49,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:49,779 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:49,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,780 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:49,783 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,786 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:49,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,792 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,794 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:49,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,801 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,806 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,807 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:49,807 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:49,818 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:49,828 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:49,838 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:49,848 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:49,867 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:49,867 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:49,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,895 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,896 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,903 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,904 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,905 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:49,905 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:49,924 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:49,924 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:49,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:49,960 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:49,961 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:49,980 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:49,980 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:50,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,017 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:50,018 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:50,037 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:50,037 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:50,062 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,063 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,065 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,073 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:50,074 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:50,093 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:50,093 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:50,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:50,133 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:50,133 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:50,151 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:50,151 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:50,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:50,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:50,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-28 10:24:50,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:50,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:24:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:24:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:24:50,276 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-02-28 10:24:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:52,015 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-02-28 10:24:52,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:24:52,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-28 10:24:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:52,019 INFO L225 Difference]: With dead ends: 483 [2019-02-28 10:24:52,019 INFO L226 Difference]: Without dead ends: 482 [2019-02-28 10:24:52,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:24:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-02-28 10:24:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-02-28 10:24:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-02-28 10:24:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-02-28 10:24:52,687 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-02-28 10:24:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:52,688 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-02-28 10:24:52,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:24:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-02-28 10:24:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:24:52,689 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:52,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:52,689 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-02-28 10:24:52,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:52,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:24:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:52,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:52,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:52,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:52,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:24:52,873 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-28 10:24:52,873 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:52,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:52,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:52,875 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:24:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:52,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:52,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:52,875 INFO 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-02-28 10:24:52,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:52,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:52,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:24:52,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:52,893 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:52,901 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:24:52,918 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:24:52,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:52,936 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:24:52,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:52,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:52,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:52,960 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:24:52,960 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:52,970 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:52,980 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:52,990 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:53,000 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:53,014 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:53,014 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-28 10:24:53,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,045 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:24:53,045 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:53,055 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:53,055 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2019-02-28 10:24:53,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,074 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:24:53,074 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:53,084 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:53,084 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-02-28 10:24:53,103 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:53,106 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:24:53,106 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:53,116 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:53,117 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:24:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:53,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:53,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:53,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:24:53,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:53,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:53,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:53,187 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-02-28 10:24:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:54,171 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-02-28 10:24:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:24:54,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-28 10:24:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:54,173 INFO L225 Difference]: With dead ends: 400 [2019-02-28 10:24:54,173 INFO L226 Difference]: Without dead ends: 393 [2019-02-28 10:24:54,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-28 10:24:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-02-28 10:24:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-02-28 10:24:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-02-28 10:24:54,846 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-02-28 10:24:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:54,846 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-02-28 10:24:54,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-02-28 10:24:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:24:54,847 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:54,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:54,847 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:54,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:54,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-02-28 10:24:54,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:54,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:54,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:54,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:24:54,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:54,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:54,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:24:54,965 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-28 10:24:54,965 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:24:54,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:24:54,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:24:54,967 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:24:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:54,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:24:54,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:54,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 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-02-28 10:24:54,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:54,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:24:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:54,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:24:54,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:54,983 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:54,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:54,987 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:54,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:54,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:54,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:54,994 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:54,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:54,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:54,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,000 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,003 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:55,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,007 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,016 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:55,017 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:55,027 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:55,037 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:55,047 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:55,057 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:55,076 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:55,076 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:55,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,107 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:55,107 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:55,124 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:55,124 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:55,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,145 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,146 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,147 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,148 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,149 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,150 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,152 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,154 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,154 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:55,155 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:55,174 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:55,174 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:55,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,198 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,203 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,205 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:55,207 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:55,207 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:55,227 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:55,227 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:55,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:55,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:24:55,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:55,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:24:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:24:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:24:55,303 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-02-28 10:24:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:56,368 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-02-28 10:24:56,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:24:56,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-28 10:24:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:56,370 INFO L225 Difference]: With dead ends: 409 [2019-02-28 10:24:56,370 INFO L226 Difference]: Without dead ends: 397 [2019-02-28 10:24:56,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:24:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-02-28 10:24:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-02-28 10:24:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-02-28 10:24:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-02-28 10:24:57,046 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-02-28 10:24:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:24:57,046 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-02-28 10:24:57,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:24:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-02-28 10:24:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:24:57,047 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:24:57,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:24:57,047 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:24:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:24:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-02-28 10:24:57,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:24:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:57,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:24:57,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:24:57,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:24:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:24:57,205 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-02-28 10:24:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:57,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:57,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:24:57,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:24:57,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:24:57,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:24:57,362 INFO 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-02-28 10:24:57,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:24:57,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:24:57,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:24:57,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:24:57,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:24:57,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:24:57,380 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:24:57,381 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,382 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:24:57,383 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,386 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:24:57,388 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,389 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,390 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,392 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,393 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,394 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,394 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:24:57,397 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,398 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,399 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,401 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,402 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,403 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,404 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,405 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,406 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,408 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,408 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:24:57,409 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,419 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,429 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,439 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,449 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,466 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,466 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:24:57,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,497 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,499 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,500 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,503 INFO L442 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 36 treesize of output 31 [2019-02-28 10:24:57,503 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,521 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:57,522 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:24:57,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,550 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,551 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,556 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:57,556 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,575 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:57,576 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:24:57,604 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,606 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,612 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,614 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,614 INFO L442 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 38 treesize of output 33 [2019-02-28 10:24:57,615 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,634 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:57,635 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-02-28 10:24:57,659 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,668 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,670 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:57,670 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,689 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:57,690 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:57,718 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,721 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,725 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:24:57,727 INFO L442 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 40 treesize of output 35 [2019-02-28 10:24:57,728 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:24:57,747 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:24:57,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:24:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:57,775 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:24:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:24:57,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:24:57,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-28 10:24:57,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:24:57,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:24:57,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:24:57,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:24:57,888 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-02-28 10:24:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:24:59,822 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-02-28 10:24:59,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:24:59,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-28 10:24:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:24:59,826 INFO L225 Difference]: With dead ends: 542 [2019-02-28 10:24:59,826 INFO L226 Difference]: Without dead ends: 536 [2019-02-28 10:24:59,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:24:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-02-28 10:25:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-02-28 10:25:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-02-28 10:25:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-02-28 10:25:00,719 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-02-28 10:25:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:00,719 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-02-28 10:25:00,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:25:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-02-28 10:25:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:00,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:00,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:00,720 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-02-28 10:25:00,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:00,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:00,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:25:00,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:00,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:00,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:00,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:00,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:00,865 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-28 10:25:00,866 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:00,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:00,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:00,868 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:25:00,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:00,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:00,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:00,869 INFO 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-02-28 10:25:00,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:00,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:00,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:25:00,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:00,899 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:00,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,901 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:00,903 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,904 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,906 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:00,909 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,915 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:00,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,919 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:00,929 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:00,930 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:00,940 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:00,950 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:00,961 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:00,971 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:00,990 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:00,991 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:01,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,020 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,023 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,025 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:01,026 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:01,045 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:01,046 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:01,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,078 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:01,078 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:01,098 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:01,098 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:25:01,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:01,133 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:01,133 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:01,153 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:01,154 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:25:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:01,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:01,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:01,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:25:01,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:01,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:25:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:25:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:25:01,235 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-02-28 10:25:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:02,552 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-02-28 10:25:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:25:02,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-28 10:25:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:02,554 INFO L225 Difference]: With dead ends: 469 [2019-02-28 10:25:02,554 INFO L226 Difference]: Without dead ends: 465 [2019-02-28 10:25:02,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:25:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-02-28 10:25:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-02-28 10:25:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-02-28 10:25:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-02-28 10:25:03,439 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-02-28 10:25:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:03,439 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-02-28 10:25:03,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:25:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-02-28 10:25:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:03,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:03,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:03,441 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:03,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:03,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-02-28 10:25:03,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:03,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:03,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:03,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:03,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:03,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:25:03,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:25:03,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:03,694 INFO 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-02-28 10:25:03,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:03,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:03,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:25:03,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:03,711 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:03,718 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,718 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:03,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,724 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:03,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,730 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,732 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,734 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,736 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,737 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:03,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,744 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,744 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,745 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,746 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,750 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,750 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,751 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,752 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:03,752 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,761 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,771 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,781 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,791 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,809 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,809 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:03,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,836 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,837 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,838 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,840 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,841 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,845 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,845 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:03,846 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,863 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:03,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:03,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,893 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,895 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,898 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:03,899 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,918 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:03,918 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-02-28 10:25:03,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:03,954 INFO L442 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 40 treesize of output 35 [2019-02-28 10:25:03,954 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:03,974 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:03,974 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-02-28 10:25:04,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,007 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,014 INFO L442 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 40 treesize of output 35 [2019-02-28 10:25:04,015 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:04,034 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:04,035 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:25:04,064 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,065 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:04,074 INFO L442 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 40 treesize of output 35 [2019-02-28 10:25:04,074 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:04,310 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:04,310 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:25:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:04,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:04,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:04,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-28 10:25:04,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:04,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:25:04,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:25:04,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:25:04,671 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-02-28 10:25:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:06,408 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-02-28 10:25:06,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:25:06,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-28 10:25:06,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:06,411 INFO L225 Difference]: With dead ends: 481 [2019-02-28 10:25:06,411 INFO L226 Difference]: Without dead ends: 480 [2019-02-28 10:25:06,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:25:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-02-28 10:25:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-02-28 10:25:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-02-28 10:25:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-02-28 10:25:06,917 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-02-28 10:25:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:06,918 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-02-28 10:25:06,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:25:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-02-28 10:25:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:06,918 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:06,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:06,918 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:06,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-02-28 10:25:06,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:06,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:07,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:07,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:07,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:07,012 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-02-28 10:25:07,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:07,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:07,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:07,016 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:25:07,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:07,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:07,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:07,017 INFO 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-02-28 10:25:07,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:07,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:07,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:25:07,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:07,034 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:07,042 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:25:07,058 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:25:07,061 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,077 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-02-28 10:25:07,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,100 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-02-28 10:25:07,100 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:07,110 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:07,121 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:07,131 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:07,141 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:07,155 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:07,155 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-02-28 10:25:07,182 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,184 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,185 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,185 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:25:07,186 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:07,196 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:07,196 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:25:07,211 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:07,213 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-02-28 10:25:07,213 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:07,223 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:07,224 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:25:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:07,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:07,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:07,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:25:07,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:07,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:25:07,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:25:07,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:25:07,277 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-02-28 10:25:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:07,965 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-02-28 10:25:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:25:07,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-28 10:25:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:07,967 INFO L225 Difference]: With dead ends: 267 [2019-02-28 10:25:07,967 INFO L226 Difference]: Without dead ends: 258 [2019-02-28 10:25:07,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:25:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-28 10:25:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-28 10:25:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-28 10:25:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-02-28 10:25:08,478 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-02-28 10:25:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:08,479 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-02-28 10:25:08,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:25:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-02-28 10:25:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:08,479 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:08,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:08,479 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-02-28 10:25:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:08,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:08,673 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-02-28 10:25:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:08,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:08,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:08,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:08,781 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-02-28 10:25:08,781 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:08,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:08,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:08,783 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:25:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:08,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:08,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:08,784 INFO 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-02-28 10:25:08,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:08,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:08,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:25:08,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:08,800 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:08,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,802 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:08,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,806 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:08,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,815 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:08,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,822 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,828 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,829 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:08,829 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:08,839 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:08,849 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:08,859 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:08,870 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:08,887 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:08,887 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:08,919 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,928 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:08,928 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:08,946 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:08,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:08,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,976 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,977 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:08,984 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:08,985 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:09,004 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:09,005 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:09,030 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,032 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,039 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:09,040 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:09,058 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:09,058 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:25:09,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:09,093 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:09,094 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:09,113 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:09,114 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:25:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:09,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:09,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:09,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:25:09,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:09,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:25:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:25:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:09,235 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-02-28 10:25:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:10,528 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-02-28 10:25:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:25:10,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-28 10:25:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:10,531 INFO L225 Difference]: With dead ends: 309 [2019-02-28 10:25:10,531 INFO L226 Difference]: Without dead ends: 306 [2019-02-28 10:25:10,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:25:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-28 10:25:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-02-28 10:25:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-28 10:25:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-02-28 10:25:11,138 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-02-28 10:25:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:11,138 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-02-28 10:25:11,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:25:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-02-28 10:25:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:11,139 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:11,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:11,139 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-02-28 10:25:11,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:11,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:11,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:11,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:11,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:11,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:11,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:11,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:11,243 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-02-28 10:25:11,244 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:11,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:11,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:11,245 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:25:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:11,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:11,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:11,246 INFO 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-02-28 10:25:11,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:11,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:11,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:25:11,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:11,265 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:11,283 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:25:11,298 INFO L442 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-02-28 10:25:11,325 INFO L442 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-02-28 10:25:11,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:11,355 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 27 treesize of output 35 [2019-02-28 10:25:11,356 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:11,366 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:11,375 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:11,385 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:11,395 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:11,407 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:11,407 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-02-28 10:25:11,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:11,427 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:25:11,427 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:11,432 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:11,432 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-28 10:25:11,443 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:11,444 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:25:11,444 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:11,449 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:11,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-02-28 10:25:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:11,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:11,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:11,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-28 10:25:11,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:11,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:25:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:25:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:25:11,497 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-02-28 10:25:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:12,617 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-02-28 10:25:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:25:12,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-28 10:25:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:12,619 INFO L225 Difference]: With dead ends: 379 [2019-02-28 10:25:12,620 INFO L226 Difference]: Without dead ends: 366 [2019-02-28 10:25:12,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:25:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-28 10:25:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-02-28 10:25:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-02-28 10:25:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-02-28 10:25:13,343 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-02-28 10:25:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:13,343 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-02-28 10:25:13,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:25:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-02-28 10:25:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:13,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:13,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:13,344 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:13,344 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-02-28 10:25:13,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:13,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:13,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:13,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:13,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:13,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:13,495 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-02-28 10:25:13,496 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:13,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:13,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:13,498 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:25:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:13,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:13,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:13,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:13,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:13,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:13,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:25:13,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:13,514 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:13,526 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:25:13,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,536 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:25:13,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,550 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:25:13,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,557 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,558 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,559 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,569 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:25:13,570 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,580 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,590 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,600 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,607 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,623 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:13,624 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:25:13,656 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,658 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,659 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,662 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:13,662 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,676 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:13,677 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:25:13,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,698 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,701 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:13,702 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,716 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:13,717 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:25:13,737 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,739 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,743 INFO L442 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 33 treesize of output 28 [2019-02-28 10:25:13,743 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,758 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:13,758 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:25:13,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,779 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,781 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:13,782 INFO L442 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 35 treesize of output 30 [2019-02-28 10:25:13,783 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:13,797 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:13,798 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:25:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:13,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:13,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:13,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:25:13,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:13,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:25:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:25:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:13,892 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-02-28 10:25:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:15,575 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-02-28 10:25:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:25:15,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-28 10:25:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:15,578 INFO L225 Difference]: With dead ends: 371 [2019-02-28 10:25:15,579 INFO L226 Difference]: Without dead ends: 366 [2019-02-28 10:25:15,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:25:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-28 10:25:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-02-28 10:25:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-28 10:25:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-02-28 10:25:16,477 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-02-28 10:25:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:16,477 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-02-28 10:25:16,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:25:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-02-28 10:25:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:16,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:16,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:16,478 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-02-28 10:25:16,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:16,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:16,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:16,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:16,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:16,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:16,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:16,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:16,644 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-02-28 10:25:16,647 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:16,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:16,648 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:16,648 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:25:16,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:16,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:16,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:16,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:16,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:16,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:16,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:25:16,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:16,665 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:16,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,667 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:16,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,672 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:16,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,677 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,681 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:16,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,685 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,687 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,688 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,689 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,716 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,731 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,758 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:16,758 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:16,759 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:16,908 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:17,034 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:17,156 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:17,295 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:17,503 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:17,504 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:17,755 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-02-28 10:25:17,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,838 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,859 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:17,975 INFO L289 Elim1Store]: Index analysis took 206 ms [2019-02-28 10:25:17,976 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:17,976 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:17,993 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:17,993 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:18,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,020 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,023 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,027 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:18,028 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:18,047 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:18,047 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:18,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,081 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,082 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:18,082 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:18,100 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:18,101 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:18,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:18,133 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:18,134 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:18,153 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:18,154 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:25:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:18,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:18,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:18,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:25:18,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:18,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:25:18,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:25:18,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:18,241 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-02-28 10:25:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:19,738 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-02-28 10:25:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:25:19,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-28 10:25:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:19,740 INFO L225 Difference]: With dead ends: 285 [2019-02-28 10:25:19,740 INFO L226 Difference]: Without dead ends: 284 [2019-02-28 10:25:19,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:25:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-28 10:25:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-02-28 10:25:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-28 10:25:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-02-28 10:25:20,648 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-02-28 10:25:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:20,648 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-02-28 10:25:20,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:25:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-02-28 10:25:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:20,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:20,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:20,649 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-02-28 10:25:20,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:20,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:20,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:20,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:20,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:20,771 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-28 10:25:20,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:20,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:20,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:20,773 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:25:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:20,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:20,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:20,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:20,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:20,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:20,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:25:20,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:20,791 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:20,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,796 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:20,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,804 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:20,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,812 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:20,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,822 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,826 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:20,826 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:20,837 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:20,847 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:20,857 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:20,868 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:20,887 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:20,887 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:20,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,909 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,917 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,919 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,919 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:20,920 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:20,939 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:20,939 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:20,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,970 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:20,973 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:20,974 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:20,993 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:20,993 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:21,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,020 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,023 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:21,026 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:21,026 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:21,046 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:21,046 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:21,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:21,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:21,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:25:21,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:21,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:25:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:25:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:25:21,138 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-02-28 10:25:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:22,508 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-02-28 10:25:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:25:22,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-28 10:25:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:22,509 INFO L225 Difference]: With dead ends: 281 [2019-02-28 10:25:22,510 INFO L226 Difference]: Without dead ends: 274 [2019-02-28 10:25:22,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-28 10:25:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-02-28 10:25:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-02-28 10:25:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-02-28 10:25:23,482 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-02-28 10:25:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:23,482 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-02-28 10:25:23,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:25:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-02-28 10:25:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:23,483 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:23,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:23,483 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:23,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-02-28 10:25:23,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:23,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:23,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:23,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:23,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:23,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:23,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:25:23,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:25:23,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:23,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:23,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:25:23,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:25:23,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:25:23,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:25:23,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:25:23,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:23,678 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:23,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,680 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:23,682 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,684 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,685 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:23,687 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,688 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,691 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,692 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,693 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,694 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:23,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,703 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,707 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,707 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:23,708 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,718 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,728 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,739 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,749 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,768 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:23,769 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:23,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,797 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,801 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,804 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:23,805 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,824 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:23,824 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:23,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,853 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,855 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,859 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,860 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,862 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,862 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:23,863 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,882 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:23,882 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:23,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,907 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,909 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,916 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:23,917 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,936 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:23,936 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:23,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:23,971 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:23,972 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:23,991 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:23,991 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:24,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:24,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:24,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:25:24,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:24,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:25:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:25:24,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:25:24,100 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-02-28 10:25:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:25,770 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-02-28 10:25:25,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:25:25,771 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-28 10:25:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:25,772 INFO L225 Difference]: With dead ends: 295 [2019-02-28 10:25:25,772 INFO L226 Difference]: Without dead ends: 288 [2019-02-28 10:25:25,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:25:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-02-28 10:25:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-02-28 10:25:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-02-28 10:25:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-02-28 10:25:26,772 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-02-28 10:25:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:26,772 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-02-28 10:25:26,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:25:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-02-28 10:25:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:26,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:26,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:26,773 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-02-28 10:25:26,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:26,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:25:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:26,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:26,934 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-28 10:25:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:27,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:27,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:27,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:25:27,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:25:27,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:27,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:27,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:25:27,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:25:27,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:25:27,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:25:27,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:25:27,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:27,040 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:27,051 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:25:27,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,070 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:25:27,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,084 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:25:27,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,102 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:25:27,103 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,112 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,120 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,130 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,140 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,157 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:27,157 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:25:27,195 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,202 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:27,202 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,216 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:27,217 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:25:27,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,246 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:27,247 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,262 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:27,262 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:25:27,286 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,288 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,289 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,290 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,291 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,292 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,293 INFO L442 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 33 treesize of output 28 [2019-02-28 10:25:27,293 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,308 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:27,308 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:25:27,331 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,332 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,334 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:27,337 INFO L442 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 33 treesize of output 28 [2019-02-28 10:25:27,338 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:27,353 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:27,353 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:25:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:27,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:27,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:27,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:25:27,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:27,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:25:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:25:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:25:27,447 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-02-28 10:25:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:29,415 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-02-28 10:25:29,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:25:29,415 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-28 10:25:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:29,417 INFO L225 Difference]: With dead ends: 370 [2019-02-28 10:25:29,417 INFO L226 Difference]: Without dead ends: 363 [2019-02-28 10:25:29,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:25:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-02-28 10:25:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-02-28 10:25:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-02-28 10:25:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-02-28 10:25:30,548 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-02-28 10:25:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:30,548 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-02-28 10:25:30,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:25:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-02-28 10:25:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:30,549 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:30,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:30,549 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-02-28 10:25:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:30,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:25:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:30,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:30,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:30,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:30,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:25:30,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:25:30,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:30,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:30,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:25:30,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:25:30,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:25:30,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:25:30,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:25:30,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:30,729 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:30,739 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:25:30,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,751 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:25:30,754 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,755 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,766 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:25:30,769 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,773 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,793 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:25:30,794 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:30,802 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:30,812 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:30,822 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:30,832 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:30,849 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:30,849 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:25:30,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,889 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:30,890 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:30,904 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:30,904 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:25:30,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,936 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:30,936 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:30,949 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:30,950 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:25:30,974 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,977 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:30,980 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:30,980 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:30,995 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:30,995 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:25:31,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:31,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:31,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:31,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:31,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:31,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:31,020 INFO L442 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 33 treesize of output 28 [2019-02-28 10:25:31,020 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:31,035 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:31,035 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:25:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:31,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:31,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:31,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:25:31,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:31,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:25:31,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:25:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:25:31,132 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-02-28 10:25:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:32,968 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-02-28 10:25:32,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:25:32,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-28 10:25:32,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:32,969 INFO L225 Difference]: With dead ends: 349 [2019-02-28 10:25:32,970 INFO L226 Difference]: Without dead ends: 344 [2019-02-28 10:25:32,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:25:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-28 10:25:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-02-28 10:25:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-28 10:25:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-02-28 10:25:33,963 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-02-28 10:25:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:33,963 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-02-28 10:25:33,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:25:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-02-28 10:25:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:33,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:33,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:33,964 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:33,964 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-02-28 10:25:33,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:33,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:33,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:25:33,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:33,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:34,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:34,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:34,085 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:34,085 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-28 10:25:34,086 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:34,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:34,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:34,089 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:25:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:34,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:34,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:34,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:34,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:34,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:34,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:25:34,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:34,142 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:34,211 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:25:34,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,221 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:25:34,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,225 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,226 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,236 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:25:34,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,254 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:25:34,254 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:34,263 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:34,273 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:34,281 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:34,291 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:34,308 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:34,308 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:25:34,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,343 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,343 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,344 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,347 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:34,348 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:34,362 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:34,362 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:25:34,381 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,382 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,383 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,386 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,387 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:34,387 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:34,402 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:34,402 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:25:34,423 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,429 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:34,430 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:34,430 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:34,445 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:34,445 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:25:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:34,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:34,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:34,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:25:34,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:34,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:25:34,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:25:34,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:25:34,520 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-02-28 10:25:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:35,906 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-02-28 10:25:35,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:25:35,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-28 10:25:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:35,907 INFO L225 Difference]: With dead ends: 257 [2019-02-28 10:25:35,907 INFO L226 Difference]: Without dead ends: 250 [2019-02-28 10:25:35,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-28 10:25:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-02-28 10:25:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-02-28 10:25:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-02-28 10:25:36,927 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-02-28 10:25:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:36,927 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-02-28 10:25:36,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:25:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-02-28 10:25:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:36,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:36,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:36,928 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:36,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-02-28 10:25:36,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:36,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:36,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:36,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:36,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:37,157 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-28 10:25:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:37,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:37,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:37,222 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:37,222 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-02-28 10:25:37,222 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:37,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:37,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:37,224 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:25:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:37,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:37,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:37,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:37,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:37,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:25:37,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:37,256 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:37,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,295 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:37,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,304 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,305 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:37,308 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,309 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,310 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,311 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,314 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,314 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:37,317 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,319 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,320 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,321 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,323 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,324 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,326 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,328 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:37,328 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,339 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,349 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,359 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,369 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,388 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:37,388 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:37,411 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,412 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,413 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,414 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,415 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,416 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,417 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,418 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,421 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:37,422 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,441 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:37,441 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:37,467 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,469 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,476 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,477 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,478 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:37,478 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,497 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:37,498 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:37,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,532 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,533 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:37,533 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,551 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:37,551 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:25:37,576 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,585 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,587 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:37,588 INFO L442 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 40 treesize of output 35 [2019-02-28 10:25:37,589 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:37,609 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:37,609 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:25:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:37,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:37,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:37,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:25:37,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:37,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:25:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:25:37,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:37,705 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-02-28 10:25:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:39,629 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-02-28 10:25:39,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:25:39,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-28 10:25:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:39,630 INFO L225 Difference]: With dead ends: 316 [2019-02-28 10:25:39,631 INFO L226 Difference]: Without dead ends: 315 [2019-02-28 10:25:39,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:25:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-28 10:25:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-02-28 10:25:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-02-28 10:25:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-02-28 10:25:40,700 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-02-28 10:25:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:40,700 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-02-28 10:25:40,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:25:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-02-28 10:25:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:40,700 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:40,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:40,701 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-02-28 10:25:40,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:40,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:40,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:40,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:40,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:40,832 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:40,832 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-28 10:25:40,833 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:40,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:40,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:40,835 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:25:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:40,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:40,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:40,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:40,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:40,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:40,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:25:40,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:40,901 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:40,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:40,939 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:40,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:40,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,003 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:41,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,018 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:41,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,023 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,028 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,030 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,032 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:41,032 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:41,043 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:41,053 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:41,063 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:41,074 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:41,093 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:41,093 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:41,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,289 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,314 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,363 INFO L289 Elim1Store]: Index analysis took 234 ms [2019-02-28 10:25:41,364 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:41,364 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:41,407 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:41,407 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:41,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,429 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,433 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,434 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,435 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,438 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:41,438 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:41,458 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:41,458 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:41,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,486 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,487 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,488 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,489 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:41,494 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:41,494 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:41,513 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:41,514 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:41,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-02-28 10:25:41,539 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:41,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:41,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:25:41,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:41,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:25:41,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:25:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:25:41,594 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-02-28 10:25:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:43,009 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-02-28 10:25:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:25:43,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-28 10:25:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:43,010 INFO L225 Difference]: With dead ends: 253 [2019-02-28 10:25:43,011 INFO L226 Difference]: Without dead ends: 246 [2019-02-28 10:25:43,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-28 10:25:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-02-28 10:25:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-02-28 10:25:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-02-28 10:25:44,060 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-02-28 10:25:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:44,060 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-02-28 10:25:44,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:25:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-02-28 10:25:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:44,061 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:44,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:44,061 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-02-28 10:25:44,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:44,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:44,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:25:44,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:44,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:44,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:25:44,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:25:44,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:44,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:44,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:25:44,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:25:44,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:25:44,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:25:44,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:25:44,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:44,255 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:44,260 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,260 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:44,262 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,264 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,266 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,267 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:44,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,270 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,272 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,273 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,274 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,275 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,276 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:44,278 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,279 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,280 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,283 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,284 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,285 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,286 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,288 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,289 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:44,289 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,300 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,310 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,320 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,330 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,349 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:44,349 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:44,404 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,405 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,406 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,407 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,407 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,408 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,409 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,411 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,412 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,413 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,414 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:44,414 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,432 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:44,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:44,462 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,463 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,464 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,465 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,466 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,467 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,473 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:44,473 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,492 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:44,492 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:44,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,531 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:44,532 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,552 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:44,552 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:25:44,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,587 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:44,590 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:44,590 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:44,610 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:44,611 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:25:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:44,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:44,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:44,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:25:44,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:44,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:25:44,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:25:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:25:44,733 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-02-28 10:25:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:46,905 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-02-28 10:25:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:25:46,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-02-28 10:25:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:46,907 INFO L225 Difference]: With dead ends: 332 [2019-02-28 10:25:46,907 INFO L226 Difference]: Without dead ends: 328 [2019-02-28 10:25:46,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:25:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-02-28 10:25:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-02-28 10:25:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-28 10:25:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-02-28 10:25:47,923 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-02-28 10:25:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:47,923 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-02-28 10:25:47,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:25:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-02-28 10:25:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:47,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:47,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:47,924 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:47,924 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-02-28 10:25:47,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:47,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:25:47,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:47,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:48,424 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-02-28 10:25:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:25:48,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:48,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:48,470 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:48,470 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-28 10:25:48,471 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:48,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:48,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:48,473 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:25:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:48,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:48,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:48,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:48,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:48,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:48,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:25:48,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:48,490 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:48,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,492 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:48,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,497 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,498 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:48,500 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,504 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,505 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,506 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,506 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:48,509 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,514 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,515 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,520 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:48,520 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:48,531 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:48,541 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:48,555 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:48,565 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:48,584 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:48,584 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:48,604 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,606 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,612 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,614 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,615 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:48,615 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:48,634 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:48,635 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:48,658 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,659 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,661 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,667 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:48,668 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:48,686 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:48,686 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-28 10:25:48,709 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,710 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,710 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,712 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,713 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,714 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,715 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,716 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,717 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,718 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:48,719 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:48,720 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:48,737 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:48,737 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:48,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:48,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:25:48,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:48,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:25:48,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:25:48,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:25:48,820 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-02-28 10:25:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:50,260 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-02-28 10:25:50,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:25:50,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-28 10:25:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:50,261 INFO L225 Difference]: With dead ends: 242 [2019-02-28 10:25:50,261 INFO L226 Difference]: Without dead ends: 241 [2019-02-28 10:25:50,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-02-28 10:25:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-02-28 10:25:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-28 10:25:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-02-28 10:25:51,333 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-02-28 10:25:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:51,334 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-02-28 10:25:51,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:25:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-02-28 10:25:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:51,334 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:51,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:51,334 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-02-28 10:25:51,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:51,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:51,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:51,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:51,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:51,484 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-28 10:25:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:51,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:51,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:51,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:51,542 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-28 10:25:51,543 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:51,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:51,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:51,544 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:25:51,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:51,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:51,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:51,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:51,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:51,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:51,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:25:51,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:51,565 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:51,572 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:25:51,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,584 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:25:51,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,599 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:25:51,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,604 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,616 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:25:51,616 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:51,626 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:51,636 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:51,646 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:51,655 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:51,671 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:51,672 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:25:51,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,703 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,706 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,707 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,708 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:51,708 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:51,721 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:51,721 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:25:51,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,744 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,745 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,746 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,747 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,748 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,749 INFO L442 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 33 treesize of output 28 [2019-02-28 10:25:51,750 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:51,783 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:51,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:25:51,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:51,915 INFO L442 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 35 treesize of output 30 [2019-02-28 10:25:51,915 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:51,930 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:51,930 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:25:51,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-02-28 10:25:51,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:52,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:52,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:25:52,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:52,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:25:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:25:52,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:25:52,009 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-02-28 10:25:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:53,562 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-02-28 10:25:53,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:25:53,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-28 10:25:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:53,563 INFO L225 Difference]: With dead ends: 254 [2019-02-28 10:25:53,563 INFO L226 Difference]: Without dead ends: 245 [2019-02-28 10:25:53,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:25:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-02-28 10:25:54,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-02-28 10:25:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-28 10:25:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-02-28 10:25:54,654 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-02-28 10:25:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:54,654 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-02-28 10:25:54,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:25:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-02-28 10:25:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:54,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:54,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:54,655 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-02-28 10:25:54,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:54,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:54,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:54,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:54,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:54,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:54,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:54,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:54,786 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-02-28 10:25:54,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:54,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:54,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:54,788 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:25:54,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:54,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:54,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:54,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:54,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:54,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:54,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:25:54,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:54,806 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:54,817 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:25:54,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,838 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:25:54,840 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,841 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,851 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:25:54,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,855 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,859 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,860 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,870 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:25:54,871 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:54,880 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:54,890 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:54,899 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:54,910 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:54,926 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:54,927 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:25:54,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:54,969 INFO L442 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 31 treesize of output 26 [2019-02-28 10:25:54,969 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:54,984 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:54,984 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:25:55,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,007 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,012 INFO L442 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 33 treesize of output 28 [2019-02-28 10:25:55,012 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:55,027 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:55,027 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:25:55,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:55,053 INFO L442 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 35 treesize of output 30 [2019-02-28 10:25:55,053 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:55,068 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:55,068 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:25:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:55,089 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:55,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:55,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:25:55,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:55,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:25:55,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:25:55,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:25:55,142 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-02-28 10:25:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:56,656 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-02-28 10:25:56,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:25:56,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-28 10:25:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:56,658 INFO L225 Difference]: With dead ends: 249 [2019-02-28 10:25:56,658 INFO L226 Difference]: Without dead ends: 248 [2019-02-28 10:25:56,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:25:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-28 10:25:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-02-28 10:25:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-28 10:25:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-02-28 10:25:57,762 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-02-28 10:25:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:25:57,762 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-02-28 10:25:57,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:25:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-02-28 10:25:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:25:57,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:25:57,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:25:57,763 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:25:57,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-02-28 10:25:57,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:25:57,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:57,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:57,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:25:57,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:25:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:25:57,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:57,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:25:57,856 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:25:57,856 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-02-28 10:25:57,857 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:25:57,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:25:57,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:25:57,858 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:25:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:25:57,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:25:57,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:25:57,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:25:57,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:25:57,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:25:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:25:57,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:25:57,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:25:57,874 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:25:57,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,876 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:25:57,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,880 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:25:57,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,889 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:25:57,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,893 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,895 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,896 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,902 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:25:57,903 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:57,911 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:57,921 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:57,931 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:57,941 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:25:57,960 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:57,961 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-02-28 10:25:57,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,982 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,988 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:57,989 INFO L442 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 36 treesize of output 31 [2019-02-28 10:25:57,989 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:58,008 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:58,009 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:25:58,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,028 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,030 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,032 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:25:58,035 INFO L442 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 38 treesize of output 33 [2019-02-28 10:25:58,035 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:25:58,060 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:25:58,061 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:25:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:58,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:25:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:25:58,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:25:58,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:25:58,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:25:58,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:25:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:25:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:25:58,200 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-02-28 10:25:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:25:59,539 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-02-28 10:25:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:25:59,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-02-28 10:25:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:25:59,541 INFO L225 Difference]: With dead ends: 239 [2019-02-28 10:25:59,541 INFO L226 Difference]: Without dead ends: 230 [2019-02-28 10:25:59,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:25:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-28 10:26:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-02-28 10:26:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-28 10:26:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-02-28 10:26:00,633 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-02-28 10:26:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:00,633 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-02-28 10:26:00,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:26:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-02-28 10:26:00,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:26:00,633 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:00,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:00,634 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:00,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:00,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-28 10:26:00,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:00,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:00,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:00,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:00,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:26:00,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:00,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:00,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:26:00,707 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-02-28 10:26:00,707 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:00,707 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:00,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:00,709 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:26:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:00,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:00,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:00,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:00,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:00,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:00,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:26:00,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:00,726 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:00,741 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:26:00,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,754 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:26:00,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,758 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,769 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:26:00,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,773 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,787 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:26:00,788 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:00,798 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:00,808 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:00,818 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:00,829 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:00,846 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:00,846 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:26:00,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,881 INFO L442 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 31 treesize of output 26 [2019-02-28 10:26:00,881 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:00,896 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:00,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:26:00,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,917 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,919 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:00,921 INFO L442 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 33 treesize of output 28 [2019-02-28 10:26:00,922 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:00,936 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:00,937 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:26:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:00,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:00,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:00,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:26:00,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:00,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:26:00,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:26:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:26:00,989 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-02-28 10:26:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:02,253 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-02-28 10:26:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:26:02,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-02-28 10:26:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:02,254 INFO L225 Difference]: With dead ends: 236 [2019-02-28 10:26:02,254 INFO L226 Difference]: Without dead ends: 227 [2019-02-28 10:26:02,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:26:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-28 10:26:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-02-28 10:26:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-28 10:26:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-02-28 10:26:03,355 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-02-28 10:26:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:03,355 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-02-28 10:26:03,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:26:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-02-28 10:26:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:03,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:03,356 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:03,356 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:03,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-02-28 10:26:03,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:03,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:03,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:03,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:03,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:03,545 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-28 10:26:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:26:03,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:03,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:03,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:03,580 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-02-28 10:26:03,580 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:03,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:03,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:03,582 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:26:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:03,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:03,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:03,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:03,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:03,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:03,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:26:03,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:03,602 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:03,610 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:26:03,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,622 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:26:03,624 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,625 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,625 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,635 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:26:03,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,642 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,653 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:26:03,653 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:03,662 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:03,672 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:03,682 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:03,692 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:03,709 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:03,709 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:26:03,737 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,739 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,742 INFO L442 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 31 treesize of output 26 [2019-02-28 10:26:03,743 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:03,757 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:03,757 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:26:03,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,779 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,781 INFO L442 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 33 treesize of output 28 [2019-02-28 10:26:03,781 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:03,794 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:03,795 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:26:03,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,829 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:03,829 INFO L442 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 33 treesize of output 28 [2019-02-28 10:26:03,830 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:03,842 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:03,842 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:26:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:03,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:03,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:03,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:26:03,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:03,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:26:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:26:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:26:03,918 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-02-28 10:26:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:05,177 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-02-28 10:26:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:26:05,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-28 10:26:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:05,179 INFO L225 Difference]: With dead ends: 236 [2019-02-28 10:26:05,179 INFO L226 Difference]: Without dead ends: 227 [2019-02-28 10:26:05,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:26:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-28 10:26:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-02-28 10:26:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-02-28 10:26:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-02-28 10:26:06,268 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-02-28 10:26:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:06,268 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-02-28 10:26:06,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:26:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-02-28 10:26:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:06,269 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:06,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:06,269 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-02-28 10:26:06,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:06,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:06,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:06,837 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-02-28 10:26:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:26:06,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:06,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:06,941 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:06,941 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-28 10:26:06,942 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:06,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:06,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:06,943 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:26:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:06,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:06,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:06,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:06,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:06,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:06,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:26:06,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:06,961 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:06,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,962 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:06,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,966 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:06,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,970 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,975 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:06,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,982 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,988 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:06,989 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:06,989 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:06,999 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:07,009 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:07,020 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:07,030 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:07,049 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:07,049 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:07,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,081 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:07,081 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:07,099 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:07,099 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:07,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,131 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:07,132 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:07,151 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:07,152 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-02-28 10:26:07,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,176 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,177 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,178 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,179 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,180 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,182 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,183 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,184 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:07,185 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:07,204 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:07,204 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:26:07,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,234 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,235 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:07,242 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:07,242 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:07,261 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:07,262 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:26:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:07,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:07,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:07,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-28 10:26:07,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:07,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:26:07,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:26:07,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:26:07,362 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-02-28 10:26:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:09,426 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-02-28 10:26:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:26:09,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-28 10:26:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:09,428 INFO L225 Difference]: With dead ends: 326 [2019-02-28 10:26:09,428 INFO L226 Difference]: Without dead ends: 316 [2019-02-28 10:26:09,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:26:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-02-28 10:26:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-02-28 10:26:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-28 10:26:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-02-28 10:26:10,586 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-02-28 10:26:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:10,586 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-02-28 10:26:10,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:26:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-02-28 10:26:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:10,586 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:10,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:10,587 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:10,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-02-28 10:26:10,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:10,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:26:10,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:10,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:10,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:10,703 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-28 10:26:10,703 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:10,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:10,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:10,706 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:26:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:10,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:10,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:10,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:10,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:10,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:10,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:26:10,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:10,723 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:10,735 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:26:10,739 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,752 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:26:10,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,758 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,760 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,770 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:26:10,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,773 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,788 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:26:10,788 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:10,798 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:10,808 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:10,818 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:10,829 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:10,845 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:10,845 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:26:10,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,881 INFO L442 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 31 treesize of output 26 [2019-02-28 10:26:10,882 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:10,896 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:10,897 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:26:10,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,917 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,918 INFO L442 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 33 treesize of output 28 [2019-02-28 10:26:10,919 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:10,939 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:10,939 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:26:10,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,959 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:10,963 INFO L442 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 35 treesize of output 30 [2019-02-28 10:26:10,964 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:10,981 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:10,981 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:26:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:11,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:11,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:11,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:26:11,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:11,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:26:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:26:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:26:11,043 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-02-28 10:26:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:12,956 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-02-28 10:26:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:26:12,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-28 10:26:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:12,958 INFO L225 Difference]: With dead ends: 288 [2019-02-28 10:26:12,958 INFO L226 Difference]: Without dead ends: 279 [2019-02-28 10:26:12,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:26:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-28 10:26:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-02-28 10:26:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-02-28 10:26:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-02-28 10:26:14,546 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-02-28 10:26:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:14,546 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-02-28 10:26:14,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:26:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-02-28 10:26:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:14,547 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:14,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:14,548 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:14,548 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-28 10:26:14,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:14,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:14,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:14,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:14,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:26:14,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:14,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:14,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:14,677 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-28 10:26:14,678 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:14,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:14,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:14,680 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:26:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:14,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:14,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:14,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:14,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:14,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:14,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:26:14,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:14,696 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:14,708 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:26:14,712 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,724 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:26:14,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,738 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:26:14,739 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,745 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,755 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:26:14,756 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:14,766 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:14,776 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:14,786 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:14,795 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:14,811 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:14,811 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:26:14,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,846 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,850 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,851 INFO L442 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 31 treesize of output 26 [2019-02-28 10:26:14,851 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:14,866 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:14,866 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:26:14,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,891 INFO L442 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 33 treesize of output 28 [2019-02-28 10:26:14,891 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:14,906 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:14,906 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:26:14,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:14,937 INFO L442 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 33 treesize of output 28 [2019-02-28 10:26:14,938 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:14,951 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:14,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:26:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:14,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:15,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:15,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:26:15,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:15,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:26:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:26:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:26:15,028 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-02-28 10:26:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:17,021 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-02-28 10:26:17,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:26:17,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-28 10:26:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:17,023 INFO L225 Difference]: With dead ends: 277 [2019-02-28 10:26:17,023 INFO L226 Difference]: Without dead ends: 268 [2019-02-28 10:26:17,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:26:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-02-28 10:26:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-02-28 10:26:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-02-28 10:26:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-02-28 10:26:18,662 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-02-28 10:26:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:18,663 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-02-28 10:26:18,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:26:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-02-28 10:26:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:18,663 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:18,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:18,664 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-02-28 10:26:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:18,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:18,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:18,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:18,892 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2019-02-28 10:26:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:26:19,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:19,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:19,008 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:19,008 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-02-28 10:26:19,009 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:19,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:19,010 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:19,010 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-28 10:26:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:19,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:19,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:19,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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:19,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:19,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:19,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:26:19,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:19,031 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:19,032 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,033 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:19,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,038 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:19,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,047 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:19,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,056 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,058 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,059 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,060 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,061 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:19,061 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,071 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,082 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,092 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,102 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,120 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,121 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:19,145 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,146 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,147 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,148 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,149 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,150 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,152 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,153 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,155 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:19,156 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,175 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:19,175 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:19,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,203 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,205 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,207 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,208 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,209 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,210 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,212 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:19,213 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,232 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:19,232 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:19,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,260 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,261 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,262 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,263 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,264 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,266 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,267 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,270 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:19,270 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,289 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:19,290 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:19,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,319 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,320 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,320 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,321 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,323 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,324 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,326 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,327 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:19,327 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,347 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:19,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:26:19,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,376 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,377 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,378 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,380 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,381 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,382 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,383 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:19,385 INFO L442 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 40 treesize of output 35 [2019-02-28 10:26:19,385 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:19,405 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:19,405 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:26:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:19,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:19,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:19,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-28 10:26:19,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:19,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:26:19,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:26:19,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:26:19,539 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-02-28 10:26:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:22,484 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-02-28 10:26:22,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:26:22,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-28 10:26:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:22,486 INFO L225 Difference]: With dead ends: 361 [2019-02-28 10:26:22,486 INFO L226 Difference]: Without dead ends: 356 [2019-02-28 10:26:22,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:26:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-02-28 10:26:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-02-28 10:26:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-02-28 10:26:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-02-28 10:26:24,222 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-02-28 10:26:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:24,222 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-02-28 10:26:24,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:26:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-02-28 10:26:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:24,223 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:24,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:24,223 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-02-28 10:26:24,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:24,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:24,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:24,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:24,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 10:26:24,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:24,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:24,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:26:24,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:26:24,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:24,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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:24,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:26:24,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:26:24,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:26:24,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:26:24,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:26:24,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:24,464 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:24,466 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,467 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:24,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,475 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:24,477 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,480 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,481 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,481 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,482 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,483 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:24,486 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,487 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,488 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,489 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,497 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:24,497 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,507 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,516 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,526 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,537 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,555 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,556 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:24,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,585 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,587 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,590 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,592 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:24,592 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,611 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:24,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:24,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,643 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,645 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,646 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,648 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:24,648 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,667 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:24,668 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:24,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,700 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,701 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,702 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,703 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,704 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,705 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,707 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,708 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,708 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:24,709 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,728 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:24,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:24,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,758 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,760 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,762 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,765 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:24,766 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,785 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:24,785 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:26:24,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:24,823 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:24,824 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:24,841 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:24,841 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:26:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:24,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:24,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:24,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-28 10:26:24,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:24,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:26:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:26:24,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:26:24,965 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-02-28 10:26:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:27,791 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-02-28 10:26:27,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:26:27,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-28 10:26:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:27,793 INFO L225 Difference]: With dead ends: 357 [2019-02-28 10:26:27,793 INFO L226 Difference]: Without dead ends: 352 [2019-02-28 10:26:27,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:26:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-02-28 10:26:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-02-28 10:26:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-02-28 10:26:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-02-28 10:26:29,292 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-02-28 10:26:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:29,292 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-02-28 10:26:29,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:26:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-02-28 10:26:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:29,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:29,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:29,293 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:29,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-02-28 10:26:29,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:29,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:29,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:26:29,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:29,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:26:29,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:29,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:29,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:26:29,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:26:29,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:29,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:29,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:26:29,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:26:29,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:26:29,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:26:29,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:26:29,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:29,596 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:29,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,598 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:29,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,602 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:29,604 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,611 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:29,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,614 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,616 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,617 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,624 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,624 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:29,625 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,635 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,645 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,655 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,665 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,684 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,684 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:29,709 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,710 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,711 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,713 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,714 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,715 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,716 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,717 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,718 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,720 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:29,720 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,739 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:29,740 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:29,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,764 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,769 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,771 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,773 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,773 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:29,774 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,793 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:29,793 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:29,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,822 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,828 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:29,828 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,848 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:29,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:29,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,884 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:29,885 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,904 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:29,904 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:26:29,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:29,943 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:29,944 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:29,963 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:29,963 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:26:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:29,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:30,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:30,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-28 10:26:30,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:30,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:26:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:26:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:26:30,095 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-02-28 10:26:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:32,342 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-02-28 10:26:32,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:26:32,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-02-28 10:26:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:32,343 INFO L225 Difference]: With dead ends: 260 [2019-02-28 10:26:32,344 INFO L226 Difference]: Without dead ends: 253 [2019-02-28 10:26:32,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:26:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-02-28 10:26:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-02-28 10:26:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-02-28 10:26:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-02-28 10:26:33,407 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-02-28 10:26:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:33,408 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-02-28 10:26:33,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:26:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-02-28 10:26:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:33,408 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:33,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:33,408 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-02-28 10:26:33,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:33,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:26:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:33,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:33,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:33,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:33,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:33,566 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-02-28 10:26:33,566 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:33,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:33,568 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:33,568 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:26:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:33,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:33,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:33,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:33,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:33,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:33,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:26:33,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:33,592 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:33,602 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:26:33,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,615 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:26:33,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,631 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:26:33,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,648 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:26:33,649 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,658 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,668 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,679 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,689 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,706 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:33,706 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:26:33,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,744 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,745 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,746 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,747 INFO L442 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 31 treesize of output 26 [2019-02-28 10:26:33,747 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,762 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:33,762 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:26:33,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,787 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,790 INFO L442 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 31 treesize of output 26 [2019-02-28 10:26:33,790 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,805 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:33,805 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:26:33,829 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,831 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,832 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,835 INFO L442 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 33 treesize of output 28 [2019-02-28 10:26:33,835 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,850 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:33,851 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:26:33,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:33,882 INFO L442 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 35 treesize of output 30 [2019-02-28 10:26:33,882 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:33,897 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:33,897 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:26:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:33,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:33,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:33,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:26:33,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:33,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:26:33,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:26:33,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:26:33,998 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-02-28 10:26:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:35,830 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-02-28 10:26:35,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:26:35,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-28 10:26:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:35,831 INFO L225 Difference]: With dead ends: 202 [2019-02-28 10:26:35,831 INFO L226 Difference]: Without dead ends: 195 [2019-02-28 10:26:35,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:26:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-28 10:26:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-02-28 10:26:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-28 10:26:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-02-28 10:26:37,066 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-02-28 10:26:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:37,066 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-02-28 10:26:37,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:26:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-02-28 10:26:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:37,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:37,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:37,067 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:37,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:37,067 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-02-28 10:26:37,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:37,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:37,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:26:37,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:37,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:37,265 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:37,265 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-28 10:26:37,267 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:37,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:37,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:37,269 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:26:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:37,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:37,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:37,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:37,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:37,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:37,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:26:37,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:37,323 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:37,362 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,363 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:37,400 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,446 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,447 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:37,486 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,509 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,521 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:37,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,532 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,534 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:37,534 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,544 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,554 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,564 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,574 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,593 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,593 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:37,615 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,616 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,617 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,625 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,625 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:37,626 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,644 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:37,645 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:37,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,677 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,680 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:37,681 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,700 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:37,700 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:37,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,725 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,729 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,730 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,731 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,732 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,733 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:37,734 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,753 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:37,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-02-28 10:26:37,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,779 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,781 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,783 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,787 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:37,787 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:37,788 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:37,807 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:37,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:26:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:37,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:37,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:37,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:26:37,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:37,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:26:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:26:37,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:26:37,909 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-02-28 10:26:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:39,756 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-02-28 10:26:39,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:26:39,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-28 10:26:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:39,757 INFO L225 Difference]: With dead ends: 199 [2019-02-28 10:26:39,757 INFO L226 Difference]: Without dead ends: 192 [2019-02-28 10:26:39,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:26:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-02-28 10:26:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-02-28 10:26:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-02-28 10:26:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-02-28 10:26:40,918 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-02-28 10:26:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:40,918 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-02-28 10:26:40,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:26:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-02-28 10:26:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:40,918 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:40,919 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:40,919 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-28 10:26:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:40,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:40,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:40,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:40,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:26:40,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:40,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:40,985 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:40,985 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-28 10:26:40,986 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:40,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:40,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:40,988 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:26:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:40,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:40,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:40,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:40,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:40,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:41,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:26:41,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:41,004 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:41,021 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:26:41,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,033 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:26:41,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,046 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:26:41,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,101 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:26:41,101 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:41,111 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:41,121 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:41,131 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:41,141 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:41,158 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:41,158 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-02-28 10:26:41,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,182 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,183 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,184 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,185 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,187 INFO L442 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 31 treesize of output 26 [2019-02-28 10:26:41,187 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:41,202 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:41,202 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:26:41,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,223 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,223 INFO L442 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 31 treesize of output 26 [2019-02-28 10:26:41,224 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:41,238 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:41,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:26:41,255 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,258 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,260 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:41,260 INFO L442 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 33 treesize of output 28 [2019-02-28 10:26:41,261 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:41,274 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:41,274 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:26:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:41,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:41,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:41,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:26:41,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:41,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:26:41,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:26:41,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:26:41,338 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-02-28 10:26:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:42,919 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-02-28 10:26:42,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:26:42,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-28 10:26:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:42,920 INFO L225 Difference]: With dead ends: 196 [2019-02-28 10:26:42,920 INFO L226 Difference]: Without dead ends: 187 [2019-02-28 10:26:42,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:26:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-28 10:26:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-02-28 10:26:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-02-28 10:26:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-02-28 10:26:44,304 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-02-28 10:26:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:44,305 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-02-28 10:26:44,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:26:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-02-28 10:26:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:44,305 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:44,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:44,305 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:44,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-28 10:26:44,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:44,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:44,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:44,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:26:44,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:44,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:44,401 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:44,401 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-28 10:26:44,401 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:44,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:44,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:44,402 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:26:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:44,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:44,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:44,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:44,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:44,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:44,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:26:44,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:44,418 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:44,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,425 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:44,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,429 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,431 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:44,435 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,439 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,441 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,443 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,446 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,446 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:44,448 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,449 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,450 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,451 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,453 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,454 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,456 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,457 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,458 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,459 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:44,459 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:44,469 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:44,480 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:44,490 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:44,500 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:44,518 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:44,519 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:44,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,543 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,549 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:44,549 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:44,568 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:44,569 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:44,592 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,596 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,601 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,602 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:44,602 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:44,622 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:44,622 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:44,643 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,645 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,646 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,650 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,651 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:44,653 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:44,653 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:44,673 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:44,673 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-02-28 10:26:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:44,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:44,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:44,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-28 10:26:44,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:44,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:26:44,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:26:44,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:26:44,761 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-02-28 10:26:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:46,584 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-02-28 10:26:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:26:46,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-28 10:26:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:46,585 INFO L225 Difference]: With dead ends: 203 [2019-02-28 10:26:46,586 INFO L226 Difference]: Without dead ends: 194 [2019-02-28 10:26:46,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:26:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-28 10:26:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-02-28 10:26:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-28 10:26:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-02-28 10:26:48,057 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-02-28 10:26:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:48,057 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-02-28 10:26:48,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:26:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-02-28 10:26:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:48,058 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:48,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:48,058 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:48,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-02-28 10:26:48,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:48,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:48,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:48,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:48,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:26:48,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:48,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:48,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:48,191 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-28 10:26:48,191 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:48,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:48,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:48,193 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:26:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:48,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:48,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:48,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:48,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:48,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:48,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:26:48,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:48,220 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:48,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,222 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:48,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,225 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,227 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,227 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:48,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,234 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,235 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,236 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:48,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,249 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:48,250 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,260 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,270 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,280 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,290 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,309 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:48,309 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:48,332 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,334 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,335 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,340 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,341 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:48,341 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,360 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:48,361 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:48,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,386 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,388 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,389 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,390 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,391 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,392 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,393 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,394 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:48,394 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,414 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:48,414 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:48,440 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,440 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,441 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,442 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,444 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,445 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,446 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,447 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,448 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,449 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,450 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:48,450 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,469 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:48,470 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-02-28 10:26:48,489 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,497 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,499 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:48,499 INFO L442 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 40 treesize of output 35 [2019-02-28 10:26:48,500 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:48,519 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:48,519 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:26:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:48,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:48,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:48,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:26:48,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:48,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:26:48,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:26:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:26:48,612 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-02-28 10:26:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:51,113 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-02-28 10:26:51,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:26:51,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-28 10:26:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:51,115 INFO L225 Difference]: With dead ends: 269 [2019-02-28 10:26:51,115 INFO L226 Difference]: Without dead ends: 265 [2019-02-28 10:26:51,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:26:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-02-28 10:26:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-02-28 10:26:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-28 10:26:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-02-28 10:26:52,902 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-02-28 10:26:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:52,902 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-02-28 10:26:52,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:26:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-02-28 10:26:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:52,903 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:52,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:52,903 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:52,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-02-28 10:26:52,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:52,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:52,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:26:53,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:53,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:53,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:53,048 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-02-28 10:26:53,049 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:53,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:53,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:53,050 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:26:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:53,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:53,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:53,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:53,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:53,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:53,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:26:53,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:53,066 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:53,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,073 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:53,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,079 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:53,081 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,088 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:53,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,095 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,101 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:53,102 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,112 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,122 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,132 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,142 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,161 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:53,161 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:53,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,188 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,192 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,195 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:53,195 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,214 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:53,214 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:53,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,250 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:53,251 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,269 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:53,270 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:53,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,298 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,298 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,300 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,301 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,302 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,306 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,306 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:53,307 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,326 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:53,326 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-02-28 10:26:53,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,356 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,358 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,359 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,360 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,362 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:53,363 INFO L442 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 40 treesize of output 35 [2019-02-28 10:26:53,363 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:53,385 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:53,385 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:26:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:53,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:53,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:53,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:26:53,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:53,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:26:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:26:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:26:53,477 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-02-28 10:26:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:26:55,968 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-02-28 10:26:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:26:55,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-28 10:26:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:26:55,970 INFO L225 Difference]: With dead ends: 253 [2019-02-28 10:26:55,970 INFO L226 Difference]: Without dead ends: 249 [2019-02-28 10:26:55,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:26:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-28 10:26:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-02-28 10:26:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-28 10:26:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-02-28 10:26:57,795 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-02-28 10:26:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:26:57,795 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-02-28 10:26:57,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:26:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-02-28 10:26:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:26:57,795 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:26:57,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:26:57,796 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:26:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-02-28 10:26:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:26:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:57,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:26:57,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:26:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:26:57,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:57,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:26:57,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:26:57,885 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-02-28 10:26:57,885 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:26:57,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:26:57,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:26:57,887 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:26:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:26:57,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:26:57,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:26:57,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:26:57,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:26:57,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:26:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:26:57,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:26:57,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:26:57,906 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:26:57,907 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:57,908 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:26:57,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:57,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:57,988 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:57,989 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:26:58,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,003 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,006 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:26:58,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,019 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:26:58,020 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:58,030 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:58,040 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:58,050 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:58,060 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:26:58,079 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:58,079 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:26:58,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,103 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,107 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,109 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:58,109 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:58,127 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:58,127 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:26:58,150 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,152 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,152 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,153 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,156 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,159 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,160 INFO L442 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 36 treesize of output 31 [2019-02-28 10:26:58,160 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:58,179 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:58,179 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:26:58,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,203 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,204 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,205 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,207 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,208 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:26:58,209 INFO L442 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 38 treesize of output 33 [2019-02-28 10:26:58,210 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:26:58,229 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:26:58,229 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-02-28 10:26:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:58,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:26:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:26:58,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:26:58,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-28 10:26:58,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:26:58,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:26:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:26:58,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:26:58,317 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-02-28 10:27:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:00,409 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-02-28 10:27:00,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:27:00,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-28 10:27:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:00,411 INFO L225 Difference]: With dead ends: 226 [2019-02-28 10:27:00,411 INFO L226 Difference]: Without dead ends: 217 [2019-02-28 10:27:00,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:27:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-02-28 10:27:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-02-28 10:27:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-28 10:27:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-02-28 10:27:02,233 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-02-28 10:27:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:02,233 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-02-28 10:27:02,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:27:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-02-28 10:27:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:27:02,233 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:27:02,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:27:02,233 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:27:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-02-28 10:27:02,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:27:02,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:02,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:27:02,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:02,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:27:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:02,509 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-28 10:27:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 10:27:02,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:02,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:27:02,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:27:02,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:27:02,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:02,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:27:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:27:02,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:27:02,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:27:02,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:27:02,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:27:02,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:27:02,652 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:27:02,654 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,655 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:27:02,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,659 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,661 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:27:02,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,668 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,670 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:27:02,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,677 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,681 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,682 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,684 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:27:02,684 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,695 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,705 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,716 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,726 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,746 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:02,746 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:27:02,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,773 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,779 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,781 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,783 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:02,783 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,803 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:02,803 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:27:02,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,828 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,829 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,832 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,836 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,837 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,838 INFO L442 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 38 treesize of output 33 [2019-02-28 10:27:02,839 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,858 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:02,859 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-02-28 10:27:02,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,893 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:02,894 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,915 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:02,915 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:02,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:02,952 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:02,952 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:02,972 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:02,973 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:03,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:27:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:03,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:27:03,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:27:03,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:27:03,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:27:03,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:27:03,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:27:03,098 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-02-28 10:27:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:05,771 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-02-28 10:27:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:27:05,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-28 10:27:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:05,773 INFO L225 Difference]: With dead ends: 258 [2019-02-28 10:27:05,773 INFO L226 Difference]: Without dead ends: 251 [2019-02-28 10:27:05,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:27:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-02-28 10:27:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-02-28 10:27:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-28 10:27:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-02-28 10:27:07,577 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-02-28 10:27:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:07,577 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-02-28 10:27:07,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:27:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-02-28 10:27:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:27:07,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:27:07,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:27:07,578 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:27:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-02-28 10:27:07,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:27:07,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:07,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:27:07,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:07,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:27:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:07,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:07,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:27:07,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:27:07,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:27:07,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:07,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:27:07,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:27:07,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:27:07,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:27:07,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:27:07,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:27:07,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:27:07,784 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:27:07,796 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:27:07,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,809 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:27:07,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,823 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:27:07,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,828 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,829 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,831 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,842 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:27:07,842 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:07,852 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:07,862 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:07,872 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:07,882 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:07,898 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:07,899 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-02-28 10:27:07,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,940 INFO L442 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 31 treesize of output 26 [2019-02-28 10:27:07,940 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:07,955 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:07,955 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:27:07,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,982 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:07,985 INFO L442 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 33 treesize of output 28 [2019-02-28 10:27:07,985 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:08,000 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:08,000 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-02-28 10:27:08,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,023 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,025 INFO L442 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 35 treesize of output 30 [2019-02-28 10:27:08,026 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:08,040 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:08,041 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-28 10:27:08,065 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:08,071 INFO L442 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 35 treesize of output 30 [2019-02-28 10:27:08,071 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:08,083 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:08,084 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:27:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:08,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:27:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:08,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:27:08,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:27:08,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:27:08,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:27:08,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:27:08,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:27:08,178 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-02-28 10:27:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:10,947 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-02-28 10:27:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:27:10,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-28 10:27:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:10,949 INFO L225 Difference]: With dead ends: 279 [2019-02-28 10:27:10,949 INFO L226 Difference]: Without dead ends: 272 [2019-02-28 10:27:10,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:27:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-28 10:27:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-02-28 10:27:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-28 10:27:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-02-28 10:27:12,985 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-02-28 10:27:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:12,986 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-02-28 10:27:12,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:27:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-02-28 10:27:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:27:12,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:27:12,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:27:12,986 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:27:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-02-28 10:27:12,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:27:12,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:12,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:27:12,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:12,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:27:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:27:13,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:13,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:27:13,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:27:13,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:27:13,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:13,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:27:13,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:27:13,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:27:13,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:27:13,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:27:13,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:27:13,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:27:13,217 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:27:13,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,220 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:27:13,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,225 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,225 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:27:13,228 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,232 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,234 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,234 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:27:13,237 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,248 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:27:13,248 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,258 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,268 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,278 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,288 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,307 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:13,307 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-02-28 10:27:13,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,334 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,335 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,340 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,341 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,343 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:13,343 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,362 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:13,362 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:27:13,389 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,390 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,390 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,391 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,393 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,394 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,395 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,396 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,397 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,398 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,399 INFO L442 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 38 treesize of output 33 [2019-02-28 10:27:13,399 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,417 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:13,417 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-02-28 10:27:13,440 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,441 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,442 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,443 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,444 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,445 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,446 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,447 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,448 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,449 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,450 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:13,451 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,470 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:13,470 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:13,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,497 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,498 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,499 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,503 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,504 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,505 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:13,506 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:13,506 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:13,525 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:13,526 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:13,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:27:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:13,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:27:13,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:27:13,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:27:13,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:27:13,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:27:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:27:13,634 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-02-28 10:27:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:16,308 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-02-28 10:27:16,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:27:16,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-28 10:27:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:16,310 INFO L225 Difference]: With dead ends: 256 [2019-02-28 10:27:16,310 INFO L226 Difference]: Without dead ends: 249 [2019-02-28 10:27:16,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:27:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-02-28 10:27:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-02-28 10:27:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-28 10:27:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-02-28 10:27:18,320 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-02-28 10:27:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:18,321 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-02-28 10:27:18,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:27:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-02-28 10:27:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:27:18,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:27:18,322 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:27:18,322 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:27:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-02-28 10:27:18,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:27:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:18,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:27:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:18,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:27:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 10:27:18,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:18,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:27:18,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:27:18,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:27:18,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:18,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:27:18,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:27:18,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:27:18,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:27:18,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:27:18,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:27:18,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:27:18,459 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:27:18,605 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-02-28 10:27:18,643 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:18,784 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-02-28 10:27:18,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:18,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:18,859 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,014 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-02-28 10:27:19,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,062 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,080 INFO L442 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 5 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:27:19,081 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,097 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,107 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,117 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,127 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,143 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:19,143 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-02-28 10:27:19,172 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,177 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,178 INFO L442 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 31 treesize of output 26 [2019-02-28 10:27:19,179 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,193 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:19,193 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:27:19,208 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,209 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,210 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,211 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,214 INFO L442 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 33 treesize of output 28 [2019-02-28 10:27:19,214 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,228 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:19,229 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:27:19,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,249 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,250 INFO L442 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 33 treesize of output 28 [2019-02-28 10:27:19,250 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,265 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:19,265 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:27:19,286 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,288 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,289 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,290 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,291 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:19,291 INFO L442 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 35 treesize of output 30 [2019-02-28 10:27:19,292 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:19,306 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:19,307 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:27:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:19,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:27:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:19,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:27:19,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-28 10:27:19,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:27:19,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:27:19,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:27:19,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:27:19,395 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-02-28 10:27:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:21,780 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-02-28 10:27:21,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:27:21,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-02-28 10:27:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:21,782 INFO L225 Difference]: With dead ends: 234 [2019-02-28 10:27:21,782 INFO L226 Difference]: Without dead ends: 207 [2019-02-28 10:27:21,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:27:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-28 10:27:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-02-28 10:27:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:27:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-02-28 10:27:22,247 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-02-28 10:27:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:22,247 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-02-28 10:27:22,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:27:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-02-28 10:27:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:27:22,248 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:27:22,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:27:22,248 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:27:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:22,248 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-02-28 10:27:22,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:27:22,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:22,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:27:22,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:22,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:27:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:27:22,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:22,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:27:22,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-28 10:27:22,482 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-02-28 10:27:22,482 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:27:22,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:27:22,484 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:27:22,484 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-28 10:27:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:22,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:27:22,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:22,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:27:22,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:27:22,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:27:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:22,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:27:22,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:27:22,499 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:27:22,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,501 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:27:22,504 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,505 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,506 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,506 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:27:22,509 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,514 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,515 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:27:22,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,528 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:27:22,529 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,539 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,548 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,558 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,568 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,586 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,587 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:27:22,612 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,614 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,615 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,616 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,617 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,622 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:22,623 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,642 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:22,642 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:27:22,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,675 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,677 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,681 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,682 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,683 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:22,683 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,702 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:22,702 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-02-28 10:27:22,730 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,731 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,732 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,734 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,735 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,736 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,737 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,739 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,741 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:22,741 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,761 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:22,761 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-02-28 10:27:22,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,792 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,797 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,798 INFO L442 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 38 treesize of output 33 [2019-02-28 10:27:22,799 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,818 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:22,818 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-02-28 10:27:22,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,850 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,852 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,855 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:22,857 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:22,857 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:22,876 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:22,876 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:22,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:27:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:23,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:27:23,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-28 10:27:23,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:27:23,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:27:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:27:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:27:23,021 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-02-28 10:27:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:24,348 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-02-28 10:27:24,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:27:24,348 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-02-28 10:27:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:24,349 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:27:24,349 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:27:24,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:27:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:27:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-02-28 10:27:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-28 10:27:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-02-28 10:27:24,869 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-02-28 10:27:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:24,869 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-02-28 10:27:24,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:27:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-02-28 10:27:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:27:24,870 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:27:24,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:27:24,870 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:27:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-02-28 10:27:24,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:27:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:24,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:27:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:24,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:27:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:27:25,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:25,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:27:25,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:27:25,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:27:25,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:25,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:27:25,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:27:25,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:27:25,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:27:25,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:27:25,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:27:25,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:27:25,110 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:27:25,111 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,112 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:27:25,113 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,115 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:27:25,117 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,118 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,120 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,121 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,122 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,124 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:27:25,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,137 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:27:25,137 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,148 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,158 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,168 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,178 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,196 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,197 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:27:25,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,223 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,225 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,226 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,227 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,228 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,231 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:25,232 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,250 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:25,250 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:27:25,278 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,278 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,279 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,280 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,280 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,281 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,283 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,285 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,286 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,286 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:25,287 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,306 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:25,306 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:27:25,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,333 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,334 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,335 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,340 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,341 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,342 INFO L442 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 38 treesize of output 33 [2019-02-28 10:27:25,343 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,360 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:25,360 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-02-28 10:27:25,390 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,391 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,392 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,393 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,394 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,395 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,397 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,398 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,399 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,400 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,401 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:25,401 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,418 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:25,419 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:25,447 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,447 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,448 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,449 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,450 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,452 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,453 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,454 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,456 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:25,457 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:25,457 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:25,474 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:25,475 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:25,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:27:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:25,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:27:25,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-28 10:27:25,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:27:25,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:27:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:27:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:27:25,598 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-02-28 10:27:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:26,874 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-02-28 10:27:26,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:27:26,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-28 10:27:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:26,875 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:27:26,875 INFO L226 Difference]: Without dead ends: 68 [2019-02-28 10:27:26,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:27:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-28 10:27:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-02-28 10:27:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:27:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-02-28 10:27:27,366 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-02-28 10:27:27,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:27,366 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-02-28 10:27:27,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:27:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-02-28 10:27:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:27:27,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:27:27,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:27:27,367 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:27:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-02-28 10:27:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:27:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:27,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:27:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:27,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:27:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:27,579 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-02-28 10:27:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:27:27,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:27,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:27:27,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:27:27,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:27:27,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:27,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:27:27,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:27:27,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:27:27,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:27:27,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:27:27,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:27:27,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:27:27,761 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:27:27,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,763 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:27:27,764 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,766 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:27:27,769 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,771 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,773 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,775 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:27:27,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,781 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,787 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,790 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:27:27,790 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:27,801 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:27,811 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:27,821 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:27,831 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:27,848 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:27,848 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:27:27,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,882 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:27,883 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:27,902 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:27,902 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-02-28 10:27:27,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,939 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:27,940 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:27,959 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:27,959 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-02-28 10:27:27,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:27,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,000 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,003 INFO L442 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 38 treesize of output 33 [2019-02-28 10:27:28,004 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:28,023 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:28,023 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-02-28 10:27:28,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,056 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,059 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,059 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:28,060 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:28,079 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:28,079 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:28,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,107 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,109 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,109 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,110 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,113 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,115 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:28,116 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:28,116 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:28,135 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:28,136 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:28,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-02-28 10:27:28,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:27:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:28,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:27:28,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-28 10:27:28,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:27:28,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:27:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:27:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:27:28,251 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-02-28 10:27:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:29,992 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-02-28 10:27:29,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:27:29,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-02-28 10:27:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:29,993 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:27:29,993 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:27:29,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:27:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:27:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-02-28 10:27:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-28 10:27:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-02-28 10:27:30,774 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-02-28 10:27:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:30,774 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-02-28 10:27:30,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:27:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-02-28 10:27:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:27:30,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:27:30,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:27:30,775 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:27:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:27:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-02-28 10:27:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:27:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:30,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:27:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:27:30,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:27:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:27:31,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:31,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:27:31,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:27:31,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:27:31,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:27:31,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 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:27:31,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:27:31,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:27:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:27:31,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:27:31,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:27:31,061 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-28 10:27:31,063 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,063 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:27:31,065 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,068 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:27:31,071 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,075 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-28 10:27:31,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,081 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,082 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,088 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-28 10:27:31,089 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,099 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,109 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,118 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,128 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,146 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,147 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-02-28 10:27:31,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,176 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,177 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,179 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,180 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,181 INFO L442 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 36 treesize of output 31 [2019-02-28 10:27:31,182 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,201 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:31,201 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-02-28 10:27:31,262 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,263 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,264 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,265 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,265 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,266 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,267 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,270 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,271 INFO L442 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 38 treesize of output 33 [2019-02-28 10:27:31,271 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,297 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:31,297 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-02-28 10:27:31,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,365 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,372 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:31,373 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,390 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:31,390 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:31,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,423 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,427 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,429 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,430 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:31,430 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,449 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:31,450 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:31,476 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,477 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,478 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,480 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,481 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,482 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,483 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:27:31,486 INFO L442 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 40 treesize of output 35 [2019-02-28 10:27:31,486 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:27:31,506 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:27:31,506 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-28 10:27:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:31,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:27:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:27:31,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:27:31,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-28 10:27:31,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:27:31,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:27:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:27:31,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:27:31,648 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-02-28 10:27:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:27:33,115 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-02-28 10:27:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:27:33,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-28 10:27:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:27:33,116 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:27:33,116 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:27:33,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:27:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:27:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:27:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:27:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:27:33,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-02-28 10:27:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:27:33,117 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:27:33,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:27:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:27:33,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:27:33,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:27:33,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:33,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:33,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:33,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:34,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:34,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:34,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:34,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:34,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:34,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:34,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:34,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:35,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:36,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:36,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:36,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:36,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:36,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:36,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:40,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:41,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:42,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:46,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:46,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:46,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:48,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:48,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:52,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:52,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:52,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:52,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:52,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:52,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:52,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:52,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:53,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:53,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:53,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:53,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:53,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:27:55,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:06,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:06,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:06,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:06,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:06,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:06,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:12,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:24,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:31,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:31,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:32,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:32,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:39,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:39,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:39,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:39,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:39,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:39,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:47,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:47,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:51,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:51,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:51,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:51,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:51,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:51,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:28:57,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:29:37,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:29:51,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:29:51,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:29:51,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:30:09,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:30:09,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:30:12,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:30:15,793 WARN L181 SmtUtils]: Spent 2.71 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-02-28 10:34:08,437 WARN L181 SmtUtils]: Spent 3.88 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-02-28 10:34:08,441 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:34:08,441 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-02-28 10:34:08,441 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-02-28 10:34:08,441 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-02-28 10:34:08,441 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-02-28 10:34:08,442 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-02-28 10:34:08,442 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:34:08,442 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-02-28 10:34:08,442 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-02-28 10:34:08,442 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-02-28 10:34:08,442 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-02-28 10:34:08,442 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-02-28 10:34:08,443 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-02-28 10:34:08,461 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:34:08 BoogieIcfgContainer [2019-02-28 10:34:08,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:34:08,462 INFO L168 Benchmark]: Toolchain (without parser) took 689851.35 ms. Allocated memory was 133.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 106.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-02-28 10:34:08,463 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:34:08,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.36 ms. Allocated memory is still 133.7 MB. Free memory was 106.4 MB in the beginning and 104.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:34:08,463 INFO L168 Benchmark]: Boogie Preprocessor took 33.63 ms. Allocated memory is still 133.7 MB. Free memory was 104.1 MB in the beginning and 103.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:34:08,463 INFO L168 Benchmark]: RCFGBuilder took 397.68 ms. Allocated memory is still 133.7 MB. Free memory was 103.0 MB in the beginning and 91.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:34:08,464 INFO L168 Benchmark]: TraceAbstraction took 689362.65 ms. Allocated memory was 133.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 91.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-02-28 10:34:08,465 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.36 ms. Allocated memory is still 133.7 MB. Free memory was 106.4 MB in the beginning and 104.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.63 ms. Allocated memory is still 133.7 MB. Free memory was 104.1 MB in the beginning and 103.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 397.68 ms. Allocated memory is still 133.7 MB. Free memory was 103.0 MB in the beginning and 91.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 689362.65 ms. Allocated memory was 133.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 91.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 689.2s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 138.9s AutomataDifference, 0.0s DeadEndRemovalTime, 395.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 60.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 59.5s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 162.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 232.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 88.2s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (1)] Forcibly destroying the process Received shutdown request...