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-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:22:33,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:22:33,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:22:33,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:22:33,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:22:33,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:22:33,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:22:33,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:22:33,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:22:33,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:22:33,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:22:33,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:22:33,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:22:33,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:22:33,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:22:33,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:22:33,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:22:33,691 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:22:33,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:22:33,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:22:33,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:22:33,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:22:33,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:22:33,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:22:33,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:22:33,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:22:33,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:22:33,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:22:33,704 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:22:33,705 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:22:33,705 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:22:33,706 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:22:33,706 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:22:33,706 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:22:33,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:22:33,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:22:33,708 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 14:22:33,734 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:22:33,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:22:33,735 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:22:33,736 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:22:33,736 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:22:33,736 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:22:33,736 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:22:33,736 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:22:33,737 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:22:33,737 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:22:33,738 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:22:33,738 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:22:33,738 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:22:33,738 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:22:33,739 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:22:33,739 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:22:33,739 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:22:33,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:22:33,741 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:22:33,742 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:22:33,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:22:33,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:22:33,742 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:22:33,743 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:22:33,743 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:22:33,743 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:22:33,743 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:22:33,743 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:22:33,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:22:33,744 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:22:33,744 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:22:33,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:22:33,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:22:33,745 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:22:33,745 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:22:33,745 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:22:33,746 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:22:33,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:22:33,746 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:22:33,746 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:22:33,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:22:33,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:22:33,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:22:33,813 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:22:33,814 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:22:33,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-01-11 14:22:33,815 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-11 14:22:33,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:22:33,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:22:33,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:22:33,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:22:33,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:22:33,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:22:33,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:22:33,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:22:33,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:22:33,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... [2019-01-11 14:22:33,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:22:33,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:22:33,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:22:33,957 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:22:33,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:22:34,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:22:34,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:22:34,290 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:22:34,291 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-11 14:22:34,292 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:22:34 BoogieIcfgContainer [2019-01-11 14:22:34,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:22:34,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:22:34,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:22:34,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:22:34,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:33" (1/2) ... [2019-01-11 14:22:34,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230b8edc and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:22:34, skipping insertion in model container [2019-01-11 14:22:34,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:22:34" (2/2) ... [2019-01-11 14:22:34,302 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-11 14:22:34,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:22:34,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-11 14:22:34,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-11 14:22:34,425 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:22:34,425 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:22:34,426 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:22:34,426 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:22:34,426 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:22:34,426 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:22:34,426 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:22:34,427 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:22:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-11 14:22:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 14:22:34,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:34,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 14:22:34,454 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:34,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-11 14:22:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:34,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:34,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:34,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:34,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:34,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:34,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:22:34,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:34,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:22:34,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:22:34,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:34,671 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-11 14:22:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:34,870 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-11 14:22:34,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:34,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 14:22:34,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:34,887 INFO L225 Difference]: With dead ends: 25 [2019-01-11 14:22:34,887 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 14:22:34,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 14:22:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-11 14:22:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 14:22:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-11 14:22:34,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-11 14:22:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:34,928 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-11 14:22:34,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:22:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-11 14:22:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:34,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:34,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:34,930 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-11 14:22:34,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:34,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:34,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:34,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:34,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:35,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:35,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:35,085 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:35,086 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-11 14:22:35,149 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:35,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:35,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:35,222 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:35,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:35,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:35,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:35,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:35,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:35,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:35,421 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 14:22:35,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:35,674 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 14:22:35,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:35,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:35,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:36,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:36,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:36,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:36,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:36,070 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,098 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,113 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,146 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:36,196 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:36,328 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-11 14:22:36,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:36,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:36,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:36,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:36,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:36,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:36,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:36,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:36,565 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-11 14:22:36,734 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-11 14:22:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:37,222 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-11 14:22:37,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:37,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:22:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:37,224 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:22:37,225 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 14:22:37,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 14:22:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-11 14:22:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 14:22:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-11 14:22:37,233 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-11 14:22:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:37,233 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-11 14:22:37,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-11 14:22:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:37,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:37,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:37,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:37,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-11 14:22:37,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:37,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:37,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:37,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:37,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:37,342 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-11 14:22:37,344 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:37,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:37,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:37,352 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:37,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:37,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:37,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:37,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:37,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:37,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:37,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:37,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:37,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:37,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,593 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:37,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:37,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:37,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:37,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:37,720 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,770 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,834 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,845 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:37,905 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:38,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:22:38,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 14:22:38,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 14:22:38,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:199 [2019-01-11 14:22:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:38,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:38,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:22:38,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:22:38,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:38,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:22:38,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:22:38,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:22:38,436 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-11 14:22:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:38,475 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-11 14:22:38,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:38,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:22:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:38,477 INFO L225 Difference]: With dead ends: 18 [2019-01-11 14:22:38,477 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 14:22:38,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:22:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 14:22:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 14:22:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:22:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-11 14:22:38,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-11 14:22:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:38,483 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-11 14:22:38,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:22:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-11 14:22:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:38,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:38,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:38,484 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-11 14:22:38,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:38,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:38,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:38,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:38,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:22:38,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:38,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:22:38,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:22:38,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:38,523 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-11 14:22:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:38,569 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-11 14:22:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:38,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:22:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:38,570 INFO L225 Difference]: With dead ends: 21 [2019-01-11 14:22:38,570 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 14:22:38,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 14:22:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-11 14:22:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:22:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-11 14:22:38,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-11 14:22:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:38,575 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-11 14:22:38,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:22:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-11 14:22:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:38,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:38,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:38,577 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-11 14:22:38,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:38,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:38,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:38,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:38,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:38,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:38,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:38,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:38,657 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-11 14:22:38,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:38,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:38,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:38,667 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:38,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:38,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:38,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:38,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:38,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:38,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:38,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:38,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:38,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:38,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:38,806 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,861 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:38,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:38,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:39,000 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,015 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,028 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,054 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:39,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:39,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:39,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:39,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-01-11 14:22:39,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:39,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:39,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:39,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:39,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:39,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:39,204 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-11 14:22:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:39,360 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-11 14:22:39,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:39,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:22:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:39,364 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:22:39,364 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 14:22:39,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 14:22:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-11 14:22:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 14:22:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-11 14:22:39,370 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-11 14:22:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:39,370 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-11 14:22:39,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-11 14:22:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:39,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:39,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:39,372 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-11 14:22:39,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:39,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:39,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:39,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:39,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:39,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:39,440 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-11 14:22:39,442 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:39,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:39,447 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:39,447 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:39,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:39,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:39,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:39,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:39,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:39,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:39,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:39,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:39,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:39,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:39,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:39,624 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:39,876 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 14:22:39,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:39,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:39,917 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,927 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,937 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,960 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:40,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-11 14:22:40,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:22:40,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:22:40,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-11 14:22:40,446 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-11 14:22:40,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 14:22:40,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:22:40,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,936 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:40,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-11 14:22:40,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 14:22:41,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-11 14:22:41,260 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-01-11 14:22:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:41,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:41,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:41,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:41,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:41,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:41,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:41,329 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-11 14:22:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:41,828 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-11 14:22:41,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:41,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:41,831 INFO L225 Difference]: With dead ends: 59 [2019-01-11 14:22:41,832 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:22:41,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:22:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-11 14:22:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 14:22:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-11 14:22:41,840 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-11 14:22:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:41,840 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-11 14:22:41,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-11 14:22:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:41,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:41,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:41,841 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:41,842 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-11 14:22:41,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:41,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:41,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:41,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:41,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:41,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:41,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:41,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:41,911 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-11 14:22:41,912 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:41,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:41,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:41,921 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:41,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:41,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:41,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:41,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:41,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:41,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:41,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:41,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:22:41,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:22:41,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:22:41,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:22:41,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,019 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:22:42,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:22:42,216 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-11 14:22:42,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:22:42,231 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,248 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,261 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,286 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 14:22:42,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-11 14:22:42,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-11 14:22:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:42,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:42,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:22:42,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 14:22:42,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:42,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:22:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:22:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:42,456 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-11 14:22:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:42,584 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-11 14:22:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:42,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:22:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:42,586 INFO L225 Difference]: With dead ends: 25 [2019-01-11 14:22:42,586 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 14:22:42,586 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-01-11 14:22:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 14:22:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-11 14:22:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 14:22:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-11 14:22:42,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-11 14:22:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:42,604 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-11 14:22:42,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:22:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-11 14:22:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:42,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:42,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:42,607 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-11 14:22:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:42,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:42,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:42,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:42,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:42,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:42,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:42,737 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-11 14:22:42,740 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:42,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:42,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:42,745 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:42,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:42,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:42,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:42,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:42,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:42,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:42,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:42,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:42,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:42,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:42,817 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,842 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:42,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:42,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:42,981 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,996 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:43,025 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:43,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:43,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:43,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:43,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:43,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:22:43,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:43,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-11 14:22:43,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-01-11 14:22:43,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:43,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:43,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:43,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:43,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:43,286 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-11 14:22:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:43,754 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-11 14:22:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:43,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:43,756 INFO L225 Difference]: With dead ends: 56 [2019-01-11 14:22:43,757 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:22:43,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:22:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-11 14:22:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 14:22:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-11 14:22:43,766 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-11 14:22:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:43,767 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-11 14:22:43,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-11 14:22:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:43,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:43,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:43,768 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-11 14:22:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:43,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:43,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:43,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:43,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:43,833 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:43,833 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-11 14:22:43,834 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:43,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:43,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:43,839 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:43,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:43,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:43,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:43,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:43,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:43,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:43,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:43,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:43,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:44,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:44,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:44,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:44,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:44,018 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,048 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,077 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,085 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:44,108 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:44,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:44,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:44,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:44,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:22:44,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:44,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:44,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:44,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:44,290 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-11 14:22:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:44,625 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-11 14:22:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:44,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:44,626 INFO L225 Difference]: With dead ends: 52 [2019-01-11 14:22:44,626 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 14:22:44,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 14:22:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-11 14:22:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 14:22:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-11 14:22:44,634 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-11 14:22:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:44,635 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-11 14:22:44,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-11 14:22:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:44,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:44,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:44,636 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-11 14:22:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:44,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:44,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:44,717 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-11 14:22:44,722 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:44,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:44,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:44,729 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:44,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:44,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:44,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:44,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:44,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:44,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:44,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:22:44,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:22:44,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:22:44,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:22:44,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,865 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:22:44,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:22:44,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:22:45,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:22:45,042 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,059 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,105 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,121 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,149 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 14:22:45,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:22:45,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 14:22:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:45,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:45,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:45,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:45,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:45,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:45,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:45,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:45,273 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-11 14:22:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:45,400 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-11 14:22:45,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:45,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:22:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:45,402 INFO L225 Difference]: With dead ends: 42 [2019-01-11 14:22:45,402 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 14:22:45,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 14:22:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-11 14:22:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 14:22:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-11 14:22:45,410 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-11 14:22:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:45,411 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-11 14:22:45,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-11 14:22:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:45,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:45,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:45,412 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:45,412 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-11 14:22:45,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:45,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:45,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:45,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:45,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:45,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:45,501 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-11 14:22:45,502 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:45,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:45,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:45,507 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:45,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:45,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:45,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:45,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:45,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:45,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:45,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:45,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:45,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:45,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:22:45,600 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:22:45,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:22:45,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:22:45,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:22:45,823 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,837 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,853 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,875 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,903 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 14:22:45,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:22:45,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:22:45,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:22:45,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:46,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 14:22:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:46,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:46,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:46,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:46,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:46,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:46,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:46,083 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-11 14:22:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:46,449 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-11 14:22:46,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:46,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:46,451 INFO L225 Difference]: With dead ends: 54 [2019-01-11 14:22:46,451 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 14:22:46,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 14:22:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-11 14:22:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 14:22:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-11 14:22:46,461 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-11 14:22:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:46,461 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-11 14:22:46,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-11 14:22:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:46,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:46,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:46,462 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-11 14:22:46,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:46,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:46,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:46,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:46,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:46,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:46,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:46,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:46,560 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-11 14:22:46,562 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:46,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:46,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:46,566 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:46,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:46,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:46,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:46,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:46,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:46,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:46,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:46,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:46,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:46,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:46,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:46,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:46,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:46,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:46,725 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,742 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,755 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:46,799 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:46,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:46,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:46,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:46,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:22:46,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:46,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 14:22:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:46,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:46,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:46,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:46,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:46,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:46,970 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-11 14:22:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:47,270 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-11 14:22:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:47,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:47,272 INFO L225 Difference]: With dead ends: 63 [2019-01-11 14:22:47,272 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 14:22:47,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 14:22:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-11 14:22:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:22:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-11 14:22:47,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-11 14:22:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:47,281 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-11 14:22:47,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-11 14:22:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:47,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:47,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:47,282 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-11 14:22:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:47,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:47,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:47,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:22:47,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:47,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:22:47,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:22:47,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:22:47,365 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-11 14:22:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:47,498 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-11 14:22:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:47,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:22:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:47,501 INFO L225 Difference]: With dead ends: 41 [2019-01-11 14:22:47,501 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 14:22:47,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:22:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 14:22:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-11 14:22:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 14:22:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-11 14:22:47,511 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-11 14:22:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:47,512 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-11 14:22:47,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:22:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-11 14:22:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:47,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:47,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:47,513 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-11 14:22:47,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:47,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:47,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:47,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:47,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:47,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:47,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:47,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:47,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:47,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:47,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:47,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:22:47,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:47,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:47,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:47,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:47,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:47,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:47,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:22:47,673 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:22:47,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:22:47,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:22:47,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:22:47,939 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,955 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,973 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,991 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,026 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 14:22:48,288 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-11 14:22:48,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:22:48,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:22:48,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,560 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:48,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-11 14:22:48,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-11 14:22:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:48,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:48,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:48,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:48,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:48,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:48,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:48,654 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-11 14:22:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:49,311 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-11 14:22:49,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:49,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:49,312 INFO L225 Difference]: With dead ends: 57 [2019-01-11 14:22:49,312 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:22:49,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:22:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-11 14:22:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 14:22:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-11 14:22:49,322 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-11 14:22:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:49,322 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-11 14:22:49,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-11 14:22:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:49,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:49,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:49,324 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:49,324 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-11 14:22:49,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:49,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:49,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:49,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:49,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:49,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:49,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:49,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:49,594 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-11 14:22:49,595 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:49,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:49,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:49,603 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:49,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:49,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:49,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:49,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:49,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:49,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:49,799 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 14:22:49,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:50,119 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 14:22:50,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:50,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:50,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:50,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:50,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:50,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:50,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:50,266 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,286 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,312 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:50,343 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:50,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:50,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:50,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:50,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:22:50,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:50,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:50,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:50,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:50,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:50,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:50,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:50,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:50,510 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-11 14:22:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:50,874 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-11 14:22:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:50,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:50,875 INFO L225 Difference]: With dead ends: 61 [2019-01-11 14:22:50,875 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 14:22:50,876 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-01-11 14:22:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 14:22:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-11 14:22:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:22:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-11 14:22:50,886 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-11 14:22:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:50,886 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-11 14:22:50,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-11 14:22:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:50,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:50,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:50,888 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-11 14:22:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:50,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:50,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:50,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:50,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:50,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:50,984 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-11 14:22:50,987 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:50,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:50,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:50,991 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:50,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:50,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:50,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:51,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:51,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:51,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:51,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:51,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:22:51,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:22:51,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:22:51,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:22:51,043 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,068 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:22:51,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:22:51,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:22:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:22:51,238 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,252 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,267 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,283 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:51,394 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 14:22:51,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:22:51,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:51,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 14:22:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:51,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:51,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:51,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:51,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:51,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:51,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:51,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:51,490 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-11 14:22:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:51,630 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-11 14:22:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:51,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:22:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:51,631 INFO L225 Difference]: With dead ends: 53 [2019-01-11 14:22:51,631 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 14:22:51,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 14:22:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-11 14:22:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 14:22:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-11 14:22:51,644 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-11 14:22:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:51,644 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-11 14:22:51,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-11 14:22:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:51,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:51,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:51,645 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-11 14:22:51,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:51,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:51,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:51,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:51,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:51,781 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-11 14:22:51,783 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:51,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:51,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:51,788 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:51,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:51,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:51,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:51,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:51,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:51,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:51,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:51,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:51,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:51,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:51,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:22:51,859 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,885 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:22:51,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:22:52,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:22:52,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:22:52,068 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,081 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,096 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,184 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 14:22:52,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:22:52,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:22:52,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:22:52,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 14:22:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:52,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:52,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:52,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:52,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:52,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:52,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:52,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:52,444 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-11 14:22:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:52,996 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-11 14:22:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:52,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:52,997 INFO L225 Difference]: With dead ends: 69 [2019-01-11 14:22:52,998 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 14:22:52,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 14:22:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-11 14:22:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 14:22:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-11 14:22:53,008 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-11 14:22:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:53,008 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-11 14:22:53,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-11 14:22:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:53,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:53,009 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 14:22:53,010 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-11 14:22:53,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:53,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:53,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:53,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:53,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:53,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:53,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:53,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:53,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:53,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:53,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:22:53,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:53,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:53,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:53,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:53,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:53,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:53,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:22:53,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,396 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:22:53,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:22:53,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:22:53,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:22:53,604 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,621 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,654 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,686 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-11 14:22:53,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:22:53,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:22:53,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-11 14:22:53,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-11 14:22:53,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:22:53,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 14:22:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:53,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:53,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:53,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 14:22:53,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:53,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:22:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:22:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:22:53,926 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-11 14:22:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:54,234 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-11 14:22:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:54,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 14:22:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:54,236 INFO L225 Difference]: With dead ends: 73 [2019-01-11 14:22:54,236 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 14:22:54,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 14:22:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-11 14:22:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 14:22:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-11 14:22:54,249 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-11 14:22:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:54,249 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-11 14:22:54,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:22:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-11 14:22:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:54,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:54,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:54,250 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-11 14:22:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:54,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:54,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:54,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:54,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:54,333 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-11 14:22:54,334 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:54,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:54,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:54,337 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:54,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:54,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:54,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:54,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:54,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:54,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:54,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:54,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:22:54,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:22:54,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:22:54,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:22:54,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,478 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:22:54,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:22:54,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:22:54,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:22:54,637 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,650 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,664 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,679 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:54,705 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:22:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:22:54,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:54,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:22:54,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-11 14:22:54,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:54,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-11 14:22:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:54,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:54,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:54,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:54,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:54,947 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-11 14:22:55,377 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-11 14:22:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:55,569 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-11 14:22:55,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:55,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:55,571 INFO L225 Difference]: With dead ends: 84 [2019-01-11 14:22:55,571 INFO L226 Difference]: Without dead ends: 78 [2019-01-11 14:22:55,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:22:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-11 14:22:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-11 14:22:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 14:22:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-11 14:22:55,588 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-11 14:22:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:55,588 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-11 14:22:55,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-11 14:22:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:55,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:55,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:55,590 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:55,590 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-11 14:22:55,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:55,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:55,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:55,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:55,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:55,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:55,734 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-11 14:22:55,735 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:55,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:55,739 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:55,740 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:55,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:55,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:55,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:55,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:55,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:55,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:55,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:22:55,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:55,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:22:55,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:22:55,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:22:55,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:55,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:55,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:55,984 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,994 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:56,025 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 14:22:56,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-11 14:22:56,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:22:56,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:22:56,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-11 14:22:56,653 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-11 14:22:56,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,983 INFO L303 Elim1Store]: Index analysis took 323 ms [2019-01-11 14:22:57,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 14:22:57,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:22:58,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,085 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:58,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-11 14:22:58,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 14:22:58,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-11 14:22:58,353 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-11 14:22:58,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,392 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:58,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-01-11 14:22:58,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-01-11 14:22:58,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,582 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:58,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-11 14:22:58,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,677 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:58,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-11 14:22:58,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-11 14:22:58,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-11 14:22:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:58,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:58,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:58,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:22:58,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:58,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:58,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:58,927 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-11 14:22:59,246 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-11 14:22:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:59,925 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-11 14:22:59,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:22:59,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:22:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:59,928 INFO L225 Difference]: With dead ends: 109 [2019-01-11 14:22:59,928 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 14:22:59,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:22:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 14:22:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-11 14:22:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 14:22:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-11 14:22:59,943 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-11 14:22:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:59,943 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-11 14:22:59,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-11 14:22:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:59,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:59,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:59,944 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-11 14:22:59,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:59,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:59,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:59,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:59,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:00,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:00,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:00,033 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-11 14:23:00,035 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:00,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:00,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:00,039 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:00,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:00,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:00,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:00,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:00,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:00,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:00,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:00,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:00,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:00,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:00,248 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,258 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:00,289 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:00,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:00,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:00,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:00,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:00,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:00,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:23:00,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-01-11 14:23:00,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:00,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:00,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:00,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:00,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:00,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:00,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:00,506 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-11 14:23:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:00,889 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-11 14:23:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:00,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:00,891 INFO L225 Difference]: With dead ends: 77 [2019-01-11 14:23:00,891 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 14:23:00,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 14:23:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-11 14:23:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 14:23:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-11 14:23:00,907 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-11 14:23:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:00,907 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-11 14:23:00,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-11 14:23:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:00,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:00,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:00,908 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-11 14:23:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:01,364 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-11 14:23:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:01,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:01,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:01,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:01,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:01,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:01,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:01,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:01,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:01,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:01,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:01,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:01,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:01,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:01,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:01,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:01,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:01,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:01,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:01,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:01,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:23:01,658 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,682 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,697 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,708 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,718 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,750 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 14:23:01,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:01,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:01,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,872 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:01,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 14:23:01,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-11 14:23:01,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-11 14:23:01,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 14:23:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:02,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:02,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:02,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:02,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:02,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:02,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:02,089 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-11 14:23:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:02,670 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-11 14:23:02,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:02,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:02,673 INFO L225 Difference]: With dead ends: 88 [2019-01-11 14:23:02,674 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 14:23:02,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:23:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 14:23:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-11 14:23:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:23:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-11 14:23:02,690 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-11 14:23:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:02,690 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-11 14:23:02,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-11 14:23:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:02,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:02,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:02,691 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-11 14:23:02,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:02,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:02,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:02,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:02,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:02,860 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:02,861 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-11 14:23:02,861 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:02,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:02,865 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:02,865 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:02,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:02,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:02,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:02,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:02,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:02,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:02,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:02,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:02,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:02,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:02,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:23:02,946 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:23:03,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:23:03,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:03,059 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,066 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,075 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:03,094 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 14:23:03,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:23:03,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:03,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:23:03,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:23:03,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:03,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-11 14:23:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:03,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:03,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:03,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:03,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:03,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:03,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:03,233 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-11 14:23:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:03,494 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-11 14:23:03,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:03,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:03,496 INFO L225 Difference]: With dead ends: 81 [2019-01-11 14:23:03,496 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 14:23:03,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 14:23:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-11 14:23:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:23:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-11 14:23:03,511 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-11 14:23:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:03,512 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-11 14:23:03,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-11 14:23:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:03,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:03,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:03,513 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:03,513 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-11 14:23:03,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:03,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:03,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:03,950 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-01-11 14:23:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:04,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:04,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:04,006 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-11 14:23:04,008 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:04,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:04,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:04,016 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:04,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:04,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:04,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:04,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:04,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:04,163 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 14:23:04,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:04,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:04,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:04,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:04,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:04,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:04,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:04,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:04,278 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,296 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,309 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,352 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:04,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:04,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:04,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:23:04,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:23:04,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,505 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:04,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 14:23:04,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:23:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:04,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:04,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:04,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:04,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:04,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:04,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:04,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:04,620 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-11 14:23:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:05,093 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-11 14:23:05,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:05,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:05,099 INFO L225 Difference]: With dead ends: 113 [2019-01-11 14:23:05,099 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 14:23:05,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:05,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 14:23:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-11 14:23:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-11 14:23:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-11 14:23:05,124 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-11 14:23:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:05,125 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-11 14:23:05,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-11 14:23:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:05,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:05,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:05,126 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-11 14:23:05,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:05,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:05,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:05,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:05,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:05,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:05,273 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-11 14:23:05,278 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:05,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:05,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:05,283 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:05,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:05,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:05,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:05,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:05,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:05,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:05,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:05,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:05,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:05,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:05,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:05,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:05,363 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:05,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:05,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:05,523 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,532 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,541 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:05,562 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:05,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:05,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 14:23:05,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 14:23:05,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-01-11 14:23:05,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2019-01-11 14:23:05,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,994 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:05,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-11 14:23:05,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 73 [2019-01-11 14:23:06,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 14:23:06,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:138, output treesize:96 [2019-01-11 14:23:06,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,217 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:06,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 14:23:06,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-11 14:23:06,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-11 14:23:06,358 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 14:23:06,415 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-11 14:23:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:06,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:06,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:06,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 14:23:06,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:06,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:06,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:06,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:06,549 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-11 14:23:06,992 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 26 [2019-01-11 14:23:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:07,600 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-11 14:23:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:23:07,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:07,603 INFO L225 Difference]: With dead ends: 137 [2019-01-11 14:23:07,603 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 14:23:07,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 14:23:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-11 14:23:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 14:23:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-11 14:23:07,636 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-11 14:23:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:07,636 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-11 14:23:07,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-11 14:23:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:07,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:07,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:07,637 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:07,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-11 14:23:07,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:07,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:07,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:07,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:07,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:07,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:07,785 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-11 14:23:07,785 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:07,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:07,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:07,789 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:07,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:07,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:07,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:07,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:07,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:07,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:07,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:07,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:08,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:08,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:08,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:08,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:08,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:08,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:23:08,136 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,160 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,173 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,185 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,195 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:08,224 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 14:23:08,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:08,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:08,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:08,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,322 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:08,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:23:08,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:08,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 14:23:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:08,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:08,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-01-11 14:23:08,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:08,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:08,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:08,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:08,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:08,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:08,464 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-11 14:23:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:08,801 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-11 14:23:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:08,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:08,803 INFO L225 Difference]: With dead ends: 120 [2019-01-11 14:23:08,804 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 14:23:08,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 14:23:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-11 14:23:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 14:23:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-11 14:23:08,842 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-11 14:23:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:08,842 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-11 14:23:08,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-11 14:23:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:08,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:08,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:08,843 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-11 14:23:08,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:08,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:08,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:08,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:08,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:09,063 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 14:23:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:09,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:09,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:09,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:09,192 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-11 14:23:09,195 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:09,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:09,203 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:09,204 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:23:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:09,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:09,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:09,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:09,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:09,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:09,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:09,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:09,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:09,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:09,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:09,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,513 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:09,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:09,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:09,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:09,669 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,683 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,698 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,714 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,740 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:09,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:23:09,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 14:23:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:09,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:09,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:23:09,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:23:09,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:09,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:23:09,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:23:09,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:23:09,927 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-11 14:23:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:10,066 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-11 14:23:10,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:23:10,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:23:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:10,068 INFO L225 Difference]: With dead ends: 105 [2019-01-11 14:23:10,068 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 14:23:10,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:23:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 14:23:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-11 14:23:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 14:23:10,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-11 14:23:10,117 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-11 14:23:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:10,118 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-11 14:23:10,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:23:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-11 14:23:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:10,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:10,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:10,119 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:10,119 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-11 14:23:10,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:10,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:10,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:10,681 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-11 14:23:10,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-01-11 14:23:10,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:10,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:10,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:10,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:10,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:10,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:10,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:23:10,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:23:10,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:23:10,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:10,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:10,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:10,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:10,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:10,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:10,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,867 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:10,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:10,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:10,983 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,993 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,002 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:11,024 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:11,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:11,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 14:23:11,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-11 14:23:11,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:199 [2019-01-11 14:23:11,387 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-01-11 14:23:11,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-11 14:23:11,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,516 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:11,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-11 14:23:11,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 14:23:11,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 14:23:11,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-11 14:23:11,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:181, output treesize:121 [2019-01-11 14:23:11,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,922 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:11,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-11 14:23:11,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-01-11 14:23:12,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:12,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-11 14:23:12,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,195 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:12,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-11 14:23:12,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-11 14:23:12,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-11 14:23:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:12,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:12,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:12,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:12,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:12,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:12,411 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-11 14:23:12,793 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-11 14:23:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:13,146 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-11 14:23:13,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:13,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:13,148 INFO L225 Difference]: With dead ends: 131 [2019-01-11 14:23:13,149 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 14:23:13,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:23:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 14:23:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-11 14:23:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:23:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-11 14:23:13,169 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-11 14:23:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:13,169 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-11 14:23:13,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-11 14:23:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:13,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:13,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:13,170 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-11 14:23:13,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:13,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:13,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:13,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:13,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:13,405 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-11 14:23:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:13,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:13,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:13,422 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:13,422 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-11 14:23:13,424 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:13,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:13,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:13,426 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:13,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:13,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:13,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:13,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:13,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:13,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:13,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:13,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:13,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:13,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:13,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:13,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:13,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:13,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:13,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,726 INFO L303 Elim1Store]: Index analysis took 119 ms [2019-01-11 14:23:13,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:13,835 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-01-11 14:23:13,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:13,847 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,862 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,877 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,893 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:13,920 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:13,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:23:13,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:13,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:23:14,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,052 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:14,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-01-11 14:23:14,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:14,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 14:23:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:14,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:14,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:14,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:14,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:14,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:14,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:14,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:14,141 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-11 14:23:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:14,554 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-11 14:23:14,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:14,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:14,556 INFO L225 Difference]: With dead ends: 71 [2019-01-11 14:23:14,556 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 14:23:14,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 14:23:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-11 14:23:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 14:23:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-11 14:23:14,580 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-11 14:23:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:14,580 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-11 14:23:14,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-11 14:23:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:14,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:14,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:14,581 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:14,581 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-11 14:23:14,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:14,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:14,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:14,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:14,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:14,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:14,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:14,681 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:14,681 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-11 14:23:14,682 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:14,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:14,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:14,685 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:14,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:14,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:14,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:14,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:14,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:14,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:14,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:14,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:14,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:14,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:14,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:14,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:14,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:14,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:14,876 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,893 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,907 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:14,949 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:14,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:14,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:15,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:23:15,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:15,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 14:23:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:15,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:15,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:15,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:15,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:15,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:15,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:15,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:15,089 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-11 14:23:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:15,358 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-11 14:23:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:15,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:15,360 INFO L225 Difference]: With dead ends: 73 [2019-01-11 14:23:15,360 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 14:23:15,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 14:23:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-11 14:23:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 14:23:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-11 14:23:15,400 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-11 14:23:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:15,400 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-11 14:23:15,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-11 14:23:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:15,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:15,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:15,402 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-11 14:23:15,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:15,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:15,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:15,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:15,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:15,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:15,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:15,496 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:15,496 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-11 14:23:15,497 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:15,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:15,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:15,500 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:15,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:15,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:15,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:15,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:15,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:15,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:15,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:15,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:15,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:15,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:15,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:15,562 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,581 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:15,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:15,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:15,707 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,717 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,726 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:15,747 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:15,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:15,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:15,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:15,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,829 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:15,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:23:15,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:15,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 14:23:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:15,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:15,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:15,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-11 14:23:15,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:15,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:23:15,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:23:15,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:15,910 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-11 14:23:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:16,149 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-11 14:23:16,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:16,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 14:23:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:16,151 INFO L225 Difference]: With dead ends: 66 [2019-01-11 14:23:16,151 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 14:23:16,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 14:23:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-11 14:23:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 14:23:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-11 14:23:16,188 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-11 14:23:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:16,188 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-11 14:23:16,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:23:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-11 14:23:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:16,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:16,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:16,189 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-11 14:23:16,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:16,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:16,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:16,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:23:16,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:23:16,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:16,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:23:16,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:23:16,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:23:16,344 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-11 14:23:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:16,413 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-11 14:23:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:23:16,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:23:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:16,414 INFO L225 Difference]: With dead ends: 54 [2019-01-11 14:23:16,414 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 14:23:16,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:23:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 14:23:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-11 14:23:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 14:23:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-11 14:23:16,444 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-11 14:23:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:16,445 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-11 14:23:16,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:23:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-11 14:23:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:16,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:16,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:16,446 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:16,446 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-11 14:23:16,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:16,651 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-11 14:23:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:16,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:16,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:16,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:16,763 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-11 14:23:16,764 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:16,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:16,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:16,766 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:16,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:16,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:16,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:16,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:16,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:16,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:16,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:16,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:23:16,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:23:16,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:16,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:16,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:16,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:16,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:16,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:23:16,882 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,898 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,911 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,921 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,930 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,950 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 14:23:16,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:16,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:17,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:17,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-11 14:23:17,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:23:17,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:17,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-11 14:23:17,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-01-11 14:23:17,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:17,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:17,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:17,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:17,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:17,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:17,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:17,171 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-11 14:23:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:17,418 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-11 14:23:17,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:17,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:17,419 INFO L225 Difference]: With dead ends: 83 [2019-01-11 14:23:17,420 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 14:23:17,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 14:23:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-11 14:23:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 14:23:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-11 14:23:17,465 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-11 14:23:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:17,465 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-11 14:23:17,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-11 14:23:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:17,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:17,466 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:23:17,466 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-11 14:23:17,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:17,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:17,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:17,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:17,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:17,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:17,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:17,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:17,540 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-11 14:23:17,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:17,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:17,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:17,546 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:23:17,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:17,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:17,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:17,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:17,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:17,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:17,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:23:17,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:23:17,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:17,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:17,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:17,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:17,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:17,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:23:17,678 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,693 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,706 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,714 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,724 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:17,743 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 14:23:17,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:23:17,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:17,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:23:17,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-01-11 14:23:17,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:17,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-11 14:23:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:17,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:17,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:17,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:17,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:17,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:17,864 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-11 14:23:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:18,347 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-11 14:23:18,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:18,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:18,349 INFO L225 Difference]: With dead ends: 86 [2019-01-11 14:23:18,349 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 14:23:18,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 14:23:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-11 14:23:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 14:23:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-11 14:23:18,410 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-11 14:23:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:18,410 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-11 14:23:18,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-11 14:23:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:18,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:18,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:18,411 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-11 14:23:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:18,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:18,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:18,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:18,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:18,558 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-11 14:23:18,559 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:18,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:18,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:18,562 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:18,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:18,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:18,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:18,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:18,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:18,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:18,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:18,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:18,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:18,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:18,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:18,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:18,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:18,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:18,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:18,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:23:18,808 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,831 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,845 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,856 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,866 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:18,897 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 14:23:18,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:18,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:18,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:19,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:23:19,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:19,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 14:23:19,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,098 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:19,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 14:23:19,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:19,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:19,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 14:23:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:19,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:19,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:19,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:19,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:19,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:19,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:19,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:19,310 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-11 14:23:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:19,831 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-11 14:23:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:19,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:19,833 INFO L225 Difference]: With dead ends: 100 [2019-01-11 14:23:19,834 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 14:23:19,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 14:23:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-11 14:23:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 14:23:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-11 14:23:19,910 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-11 14:23:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:19,910 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-11 14:23:19,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-11 14:23:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:19,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:19,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:19,911 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-11 14:23:19,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:19,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:19,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:19,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:19,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:20,067 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:23:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:20,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:20,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:20,300 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:20,300 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-11 14:23:20,301 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:20,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:20,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:20,303 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:20,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:20,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:20,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:20,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:20,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:20,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:20,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:20,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:20,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:20,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:20,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:20,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:20,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:20,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:20,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:20,574 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,596 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,609 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,656 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:20,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:20,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:20,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:20,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:23:20,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,802 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:20,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:23:20,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:23:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:20,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:20,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:20,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:20,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:20,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:20,916 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-11 14:23:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:21,387 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-11 14:23:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:21,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:21,389 INFO L225 Difference]: With dead ends: 104 [2019-01-11 14:23:21,389 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 14:23:21,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 14:23:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-11 14:23:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 14:23:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-11 14:23:21,491 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-11 14:23:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:21,492 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-11 14:23:21,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-11 14:23:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:21,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:21,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:21,493 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:21,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:21,493 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-11 14:23:21,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:21,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:21,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:21,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:21,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:21,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:21,561 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-11 14:23:21,562 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:21,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:21,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:21,565 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:21,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:21,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:21,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:21,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:21,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:21,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:21,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:21,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:21,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:21,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:21,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:21,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:21,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:21,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:21,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:21,699 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,717 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,739 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,749 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:21,779 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:21,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:21,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:21,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:21,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:21,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:21,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:23:21,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,916 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:21,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:23:21,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:21,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:23:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:21,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:22,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:22,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:22,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:22,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:22,053 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-11 14:23:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:22,623 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-11 14:23:22,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:22,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:22,625 INFO L225 Difference]: With dead ends: 107 [2019-01-11 14:23:22,625 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 14:23:22,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 14:23:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-11 14:23:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 14:23:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-11 14:23:22,724 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-11 14:23:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:22,724 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-11 14:23:22,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-11 14:23:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:22,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:22,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:22,726 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:22,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:22,726 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-11 14:23:22,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:22,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:22,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:22,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:22,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:22,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:22,791 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-11 14:23:22,793 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:22,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:22,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:22,797 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:22,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:22,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:22,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:22,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:22,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:22,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:22,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:22,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:22,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:22,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:22,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:22,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:22,888 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:22,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:23,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:23,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:23,082 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,101 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,121 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,144 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:23,178 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:23,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:23,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:23,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:23,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:23:23,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:23,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 14:23:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:23,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:23,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:23,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:23,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:23,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:23,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:23,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:23,411 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-11 14:23:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:23,800 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-11 14:23:23,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:23,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:23,802 INFO L225 Difference]: With dead ends: 100 [2019-01-11 14:23:23,803 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 14:23:23,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 14:23:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-11 14:23:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 14:23:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-11 14:23:23,911 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-11 14:23:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:23,911 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-11 14:23:23,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-11 14:23:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:23,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:23,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:23,912 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-11 14:23:23,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:23,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:23,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:23,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:23,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:24,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:24,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:24,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:24,015 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-11 14:23:24,017 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:24,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:24,019 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:24,020 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:24,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:24,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:24,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:24,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:24,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:24,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:24,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:24,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:24,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:24,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:24,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:24,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:24,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:24,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:24,174 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,190 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,203 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,213 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,223 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:24,245 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:24,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:24,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 14:23:24,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 14:23:24,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-01-11 14:23:24,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2019-01-11 14:23:24,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,647 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:24,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 14:23:24,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,717 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:24,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-11 14:23:24,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 14:23:24,770 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:142, output treesize:92 [2019-01-11 14:23:24,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 14:23:24,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2019-01-11 14:23:24,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:24,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,957 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:24,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-11 14:23:24,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 14:23:25,002 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-11 14:23:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:25,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:25,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:25,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:25,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:25,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:25,256 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-11 14:23:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:26,213 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-11 14:23:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:26,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:26,215 INFO L225 Difference]: With dead ends: 124 [2019-01-11 14:23:26,215 INFO L226 Difference]: Without dead ends: 123 [2019-01-11 14:23:26,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:23:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-11 14:23:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-11 14:23:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 14:23:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-11 14:23:26,320 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-11 14:23:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:26,321 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-11 14:23:26,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-11 14:23:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:26,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:26,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:26,322 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:26,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:26,322 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-11 14:23:26,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:26,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:26,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:26,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:26,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:26,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:26,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:26,445 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:26,445 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-11 14:23:26,446 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:26,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:26,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:26,449 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:26,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:26,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:26,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:26,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:26,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:26,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:26,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:26,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:26,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:26,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:26,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:26,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:23:26,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:26,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:26,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:26,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:26,722 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,738 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,769 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:26,800 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 14:23:26,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:26,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:26,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:26,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,886 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:26,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:23:26,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:26,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 14:23:26,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,963 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:26,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:23:26,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:26,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:23:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:27,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:27,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:27,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:23:27,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:27,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:23:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:23:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:27,071 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-11 14:23:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:27,756 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-11 14:23:27,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:27,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:23:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:27,759 INFO L225 Difference]: With dead ends: 114 [2019-01-11 14:23:27,759 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 14:23:27,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 14:23:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-11 14:23:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 14:23:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-11 14:23:27,921 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-11 14:23:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:27,921 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-11 14:23:27,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:23:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-11 14:23:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:27,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:27,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:27,922 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:27,922 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-11 14:23:27,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:27,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:27,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:27,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:27,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:28,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:28,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:28,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:28,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:28,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:28,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:28,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:28,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:28,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:28,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:28,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:28,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:28,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:28,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:28,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:28,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:23:28,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,112 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,139 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:28,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:28,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:28,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:28,350 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,372 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,396 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,418 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:28,453 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 14:23:28,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:28,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:28,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:28,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:23:28,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:28,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 14:23:28,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,669 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:28,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:23:28,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:28,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 14:23:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:28,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:28,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:28,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:28,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:28,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:28,763 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-11 14:23:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:29,334 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-11 14:23:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:23:29,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:29,336 INFO L225 Difference]: With dead ends: 164 [2019-01-11 14:23:29,336 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 14:23:29,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 14:23:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-11 14:23:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 14:23:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-11 14:23:29,699 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-11 14:23:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:29,700 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-11 14:23:29,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-11 14:23:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:29,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:29,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:29,701 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:29,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-11 14:23:29,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:29,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:29,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:29,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:29,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:29,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:29,775 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-11 14:23:29,775 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:29,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:29,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:29,779 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:29,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:29,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:29,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:29,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:29,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:29,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:29,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:29,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:29,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:29,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:29,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:29,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:29,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:29,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:30,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:30,001 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,022 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,035 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,046 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,056 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:30,084 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:30,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:23:30,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:30,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:30,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:23:30,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:30,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:23:30,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:30,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:30,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 14:23:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:30,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:30,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:30,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:30,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:30,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:30,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:30,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:30,352 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-11 14:23:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:30,852 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-11 14:23:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:30,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:30,855 INFO L225 Difference]: With dead ends: 160 [2019-01-11 14:23:30,856 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 14:23:30,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 14:23:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-11 14:23:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 14:23:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-11 14:23:31,103 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-11 14:23:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:31,104 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-11 14:23:31,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-11 14:23:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:31,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:31,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:31,105 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-11 14:23:31,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:31,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:31,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:31,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:31,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:31,200 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:31,201 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-11 14:23:31,202 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:31,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:31,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:31,204 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:31,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:31,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:31,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:31,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:31,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:31,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:31,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:31,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:31,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:31,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:31,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:23:31,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:23:31,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:23:31,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:31,377 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,386 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:31,414 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 14:23:31,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:23:31,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:31,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:23:31,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:31,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:31,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:31,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:31,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-11 14:23:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:31,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:31,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:31,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:31,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:31,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:31,554 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-11 14:23:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:32,295 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-11 14:23:32,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:32,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:32,297 INFO L225 Difference]: With dead ends: 175 [2019-01-11 14:23:32,297 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 14:23:32,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 14:23:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-11 14:23:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 14:23:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-11 14:23:32,540 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-11 14:23:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:32,540 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-11 14:23:32,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-11 14:23:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:32,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:32,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:32,541 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-11 14:23:32,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:32,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:32,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:23:32,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:23:32,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:23:32,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:32,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:23:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:23:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:23:32,636 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-11 14:23:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:33,016 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-11 14:23:33,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:23:33,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-11 14:23:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:33,018 INFO L225 Difference]: With dead ends: 185 [2019-01-11 14:23:33,018 INFO L226 Difference]: Without dead ends: 184 [2019-01-11 14:23:33,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:23:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-11 14:23:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-11 14:23:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 14:23:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-11 14:23:33,261 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-11 14:23:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:33,262 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-11 14:23:33,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:23:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-11 14:23:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:33,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:33,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:33,263 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:33,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:33,263 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-11 14:23:33,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:33,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:33,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:33,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:33,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:33,338 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-11 14:23:33,339 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:33,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:33,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:33,341 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:33,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:33,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:33,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:33,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:33,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:33,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:33,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:23:33,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:23:33,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:33,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:33,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:33,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:33,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:33,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:23:33,492 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,531 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,543 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:33,586 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 14:23:33,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:23:33,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:33,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:23:33,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,653 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:33,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-11 14:23:33,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:33,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:23:33,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-01-11 14:23:33,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:33,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:33,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:33,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:33,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:33,725 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-11 14:23:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:34,194 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-11 14:23:34,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:34,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:34,197 INFO L225 Difference]: With dead ends: 142 [2019-01-11 14:23:34,197 INFO L226 Difference]: Without dead ends: 141 [2019-01-11 14:23:34,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-11 14:23:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-11 14:23:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-11 14:23:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-11 14:23:34,451 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-11 14:23:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:34,451 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-11 14:23:34,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-11 14:23:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:34,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:34,452 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:23:34,452 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:34,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:34,452 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-11 14:23:34,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:34,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:34,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:34,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:34,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:34,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:34,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:34,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:34,499 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-11 14:23:34,500 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:34,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:34,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:34,502 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:34,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:34,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:34,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:34,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:34,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:34,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:34,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:34,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:34,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:34,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:34,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:34,567 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:34,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:34,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:34,760 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,775 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,805 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:34,834 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:34,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:34,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:34,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:34,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 14:23:34,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:35,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:35,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:35,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-11 14:23:35,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:35,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 14:23:35,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:35,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:35,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:23:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:35,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:35,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:35,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 14:23:35,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:35,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:23:35,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:23:35,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:35,147 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-11 14:23:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:35,885 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-11 14:23:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:35,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:23:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:35,888 INFO L225 Difference]: With dead ends: 219 [2019-01-11 14:23:35,888 INFO L226 Difference]: Without dead ends: 216 [2019-01-11 14:23:35,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-11 14:23:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-11 14:23:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-11 14:23:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-11 14:23:36,179 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-11 14:23:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:36,180 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-11 14:23:36,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:23:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-11 14:23:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:36,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:36,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:36,181 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-11 14:23:36,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:36,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:36,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:36,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:36,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:36,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:36,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:36,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:36,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:36,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:36,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:23:36,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:23:36,313 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:23:36,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:36,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:36,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:36,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:36,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:36,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:36,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:36,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:36,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:23:36,451 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,468 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,482 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,492 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:36,524 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 14:23:36,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-11 14:23:36,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:36,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:36,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-11 14:23:36,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 14:23:36,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:36,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-01-11 14:23:36,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-11 14:23:36,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-11 14:23:36,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,970 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:36,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-01-11 14:23:36,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-11 14:23:37,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,178 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:37,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-11 14:23:37,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-11 14:23:37,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:37,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 14:23:37,378 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-11 14:23:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:37,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:37,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:37,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:37,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:37,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:37,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:37,544 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-11 14:23:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:38,773 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-11 14:23:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:38,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:38,777 INFO L225 Difference]: With dead ends: 218 [2019-01-11 14:23:38,777 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 14:23:38,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:23:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 14:23:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-11 14:23:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-11 14:23:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-11 14:23:39,126 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-11 14:23:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:39,126 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-11 14:23:39,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-11 14:23:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:39,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:39,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:39,127 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-11 14:23:39,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:39,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:39,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:39,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:39,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:39,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:39,251 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-11 14:23:39,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:39,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:39,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:39,254 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:39,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:39,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:39,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:39,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:39,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:39,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:39,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:39,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:39,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:39,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:39,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:39,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:39,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:39,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:39,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:39,467 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,829 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,839 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,849 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:39,876 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:39,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:23:39,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:39,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:23:39,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-11 14:23:39,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:39,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-11 14:23:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:40,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:40,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:40,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:40,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:40,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:40,036 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-11 14:23:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:40,861 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-11 14:23:40,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:40,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:23:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:40,864 INFO L225 Difference]: With dead ends: 274 [2019-01-11 14:23:40,864 INFO L226 Difference]: Without dead ends: 269 [2019-01-11 14:23:40,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-11 14:23:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-11 14:23:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 14:23:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-11 14:23:41,384 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-11 14:23:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:41,385 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-11 14:23:41,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-11 14:23:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:23:41,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:41,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:23:41,386 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-11 14:23:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:41,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:41,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:41,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:41,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-01-11 14:23:41,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:41,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:41,507 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:23:41,507 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-11 14:23:41,508 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:41,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:41,510 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:41,510 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:41,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:41,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:41,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:41,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:41,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:41,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:41,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:41,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:41,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:41,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:41,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:41,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:41,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:41,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:41,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:41,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:41,762 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,777 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,792 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,808 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:41,837 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:41,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:23:41,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:41,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:23:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:41,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:23:41,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:42,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:42,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 14:23:42,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:42,079 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:42,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-11 14:23:42,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:42,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:42,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-11 14:23:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:42,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:42,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:42,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 14:23:42,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:42,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:42,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:42,158 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-11 14:23:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:43,700 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-11 14:23:43,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:23:43,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:23:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:43,705 INFO L225 Difference]: With dead ends: 480 [2019-01-11 14:23:43,706 INFO L226 Difference]: Without dead ends: 477 [2019-01-11 14:23:43,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-11 14:23:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-11 14:23:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-11 14:23:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-11 14:23:44,598 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-11 14:23:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:44,599 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-11 14:23:44,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-11 14:23:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:44,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:44,600 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 14:23:44,600 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-11 14:23:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:44,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:44,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:44,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:44,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:44,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:44,650 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-11 14:23:44,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:44,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:44,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:44,653 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:23:44,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:44,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:44,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:44,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:44,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:44,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:44,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:44,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:44,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:44,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 14:23:44,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 14:23:44,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 14:23:44,711 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,739 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:44,758 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-11 14:23:44,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 14:23:44,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 14:23:44,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-11 14:23:44,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-11 14:23:44,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-01-11 14:23:44,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:44,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:23:44,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-11 14:23:44,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:44,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:23:44,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:23:44,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:44,802 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-11 14:23:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:46,753 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-11 14:23:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:23:46,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-11 14:23:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:46,760 INFO L225 Difference]: With dead ends: 804 [2019-01-11 14:23:46,760 INFO L226 Difference]: Without dead ends: 800 [2019-01-11 14:23:46,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-11 14:23:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-11 14:23:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-11 14:23:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-11 14:23:48,896 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-11 14:23:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:48,897 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-11 14:23:48,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:23:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-11 14:23:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:48,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:48,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:48,900 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-11 14:23:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:48,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:48,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:48,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:48,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:49,060 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-11 14:23:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:49,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:49,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:49,105 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:49,105 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-11 14:23:49,106 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:49,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:49,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:49,108 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:49,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:49,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:49,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:49,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:49,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:49,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:49,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:49,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:49,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:23:49,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:23:49,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:23:49,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,239 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:49,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:49,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:49,428 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,442 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,458 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,475 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,507 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 14:23:49,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:49,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:49,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:23:49,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 14:23:49,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,684 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:49,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 14:23:49,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 14:23:49,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,780 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:49,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:23:49,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 14:23:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:49,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:49,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:49,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:23:49,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:49,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:49,919 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-11 14:23:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:52,786 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-11 14:23:52,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:52,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:23:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:52,793 INFO L225 Difference]: With dead ends: 821 [2019-01-11 14:23:52,793 INFO L226 Difference]: Without dead ends: 820 [2019-01-11 14:23:52,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:23:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-11 14:23:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-11 14:23:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-11 14:23:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-11 14:23:54,777 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-11 14:23:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:54,777 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-11 14:23:54,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-11 14:23:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:54,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:54,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:54,780 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:54,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-11 14:23:54,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:54,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:54,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:54,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:54,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:54,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:54,825 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-11 14:23:54,826 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:54,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:54,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:54,827 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:54,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:54,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:54,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:54,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:54,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:54,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:54,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-11 14:23:54,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-11 14:23:54,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-11 14:23:54,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:54,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-11 14:23:54,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:54,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:54,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 14:23:54,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 14:23:54,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:54,971 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,986 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:54,996 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:55,006 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:55,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:55,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:55,034 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-11 14:23:55,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 14:23:55,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:55,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:55,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-11 14:23:55,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:55,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:23:55,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:55,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:55,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-11 14:23:55,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-01-11 14:23:55,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:55,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:55,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:55,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:55,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:55,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:55,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:55,135 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-11 14:23:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:57,261 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-11 14:23:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:57,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:23:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:57,268 INFO L225 Difference]: With dead ends: 805 [2019-01-11 14:23:57,268 INFO L226 Difference]: Without dead ends: 804 [2019-01-11 14:23:57,268 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-01-11 14:23:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-11 14:23:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-11 14:23:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-11 14:23:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-11 14:23:59,391 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-11 14:23:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:59,392 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-11 14:23:59,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-11 14:23:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:59,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:59,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:59,393 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-11 14:23:59,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:59,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:59,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:59,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:59,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:59,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:59,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:59,544 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:59,544 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-11 14:23:59,545 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:59,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:59,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:59,548 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:59,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:59,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:59,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:59,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:59,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:59,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:59,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:23:59,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:23:59,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:23:59,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:23:59,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:23:59,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,640 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:59,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:59,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:59,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:59,804 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,833 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,850 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:59,877 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:23:59,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:59,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:59,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:59,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:59,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:59,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:24:00,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,015 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:00,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:00,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:24:00,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:00,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:00,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:24:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:00,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:00,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:00,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:24:00,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:00,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:00,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:00,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:00,129 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-11 14:24:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:03,015 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-11 14:24:03,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:03,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:24:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:03,026 INFO L225 Difference]: With dead ends: 1004 [2019-01-11 14:24:03,026 INFO L226 Difference]: Without dead ends: 1003 [2019-01-11 14:24:03,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-11 14:24:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-11 14:24:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-11 14:24:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-11 14:24:05,350 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-11 14:24:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:05,350 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-11 14:24:05,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-11 14:24:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:05,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:05,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:05,353 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-11 14:24:05,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:05,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:05,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:05,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:05,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:05,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:05,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:05,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:05,455 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-11 14:24:05,456 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:05,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:05,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:05,458 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:05,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:05,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:05,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:05,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:05,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:05,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:05,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:24:05,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:24:05,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:24:05,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:05,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:24:05,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:24:05,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:24:05,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:24:05,581 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,597 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,620 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:05,649 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 14:24:05,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-11 14:24:05,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:05,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-11 14:24:05,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:05,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:24:05,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:24:05,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:24:05,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-11 14:24:09,806 WARN L181 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-01-11 14:24:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:09,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:09,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:09,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 14:24:09,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:09,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:24:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:24:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:09,843 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-11 14:24:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:13,128 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-11 14:24:13,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:13,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 14:24:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:13,138 INFO L225 Difference]: With dead ends: 1213 [2019-01-11 14:24:13,138 INFO L226 Difference]: Without dead ends: 1212 [2019-01-11 14:24:13,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-11 14:24:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-11 14:24:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-11 14:24:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-11 14:24:16,157 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-11 14:24:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:16,157 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-11 14:24:16,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:24:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-11 14:24:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:16,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:16,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:16,161 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:16,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:16,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-11 14:24:16,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:16,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:16,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:16,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:16,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:16,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:16,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:16,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:16,295 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-11 14:24:16,296 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:16,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:16,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:16,298 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:24:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:16,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:16,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:16,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:16,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:16,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:16,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:16,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:16,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:24:16,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:24:16,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:24:16,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:24:16,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:16,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:16,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:24:16,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:16,587 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,604 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,619 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,636 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:16,667 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 14:24:16,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:24:16,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:16,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:24:16,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,794 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:16,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 14:24:16,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:16,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-11 14:24:16,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-11 14:24:16,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:16,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-11 14:24:16,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:16,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:16,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 14:24:16,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:16,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:16,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:24:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:17,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:17,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:17,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:24:17,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:17,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:24:17,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:24:17,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:17,069 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-11 14:24:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:21,500 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-11 14:24:21,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:24:21,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:24:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:21,515 INFO L225 Difference]: With dead ends: 1577 [2019-01-11 14:24:21,515 INFO L226 Difference]: Without dead ends: 1575 [2019-01-11 14:24:21,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:24:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-11 14:24:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-11 14:24:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-11 14:24:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-11 14:24:23,623 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-11 14:24:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:23,623 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-11 14:24:23,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:24:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-11 14:24:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:23,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:23,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:23,625 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-11 14:24:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:23,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:23,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:23,784 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:24:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:23,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:23,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:23,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:23,915 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-11 14:24:23,916 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:23,916 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:23,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:23,918 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:24:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:23,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:23,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:23,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:23,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:23,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:23,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:23,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:23,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:24:23,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:24:23,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:23,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:24:24,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:24:24,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,027 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:24:24,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:24:24,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:24:24,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,156 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,165 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:24,187 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 14:24:24,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:24:24,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:24,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:24:24,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,274 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:24,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:24:24,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:24,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-11 14:24:24,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:24:24,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:24,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 14:24:24,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,376 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:24,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:24:24,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:24,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 14:24:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:24,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:24,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:24:24,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:24,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:24:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:24:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:24:24,488 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-11 14:24:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:27,945 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-11 14:24:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:27,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:24:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:27,951 INFO L225 Difference]: With dead ends: 1108 [2019-01-11 14:24:27,952 INFO L226 Difference]: Without dead ends: 1107 [2019-01-11 14:24:27,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:24:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-11 14:24:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-11 14:24:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-11 14:24:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-11 14:24:30,988 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-11 14:24:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:30,988 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-11 14:24:30,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:24:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-11 14:24:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:30,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:30,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:30,990 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-11 14:24:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:30,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:30,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:31,357 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-01-11 14:24:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:31,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:31,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:31,428 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:31,428 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-11 14:24:31,429 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:31,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:31,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:31,431 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:31,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:31,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:31,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:31,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:31,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:31,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:31,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:31,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:24:31,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:24:31,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:24:31,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:24:31,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:24:31,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:24:31,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:24:31,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:24:31,657 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,691 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,703 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,719 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:31,747 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:24:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:24:31,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:31,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:24:31,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,829 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:31,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:24:31,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:24:31,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:24:31,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 14:24:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:31,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:32,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:32,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:32,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:32,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:32,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:32,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:32,005 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-11 14:24:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:35,045 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-11 14:24:35,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:35,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:24:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:35,050 INFO L225 Difference]: With dead ends: 1075 [2019-01-11 14:24:35,050 INFO L226 Difference]: Without dead ends: 1074 [2019-01-11 14:24:35,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-11 14:24:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-11 14:24:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-11 14:24:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-11 14:24:38,049 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-11 14:24:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:38,050 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-11 14:24:38,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-11 14:24:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:38,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:38,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:38,052 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-11 14:24:38,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:38,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:38,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:38,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:38,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:38,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:38,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:38,145 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-11 14:24:38,145 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:38,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:38,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:38,147 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:24:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:38,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:38,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:38,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:38,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:38,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:38,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:38,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:38,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:24:38,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:24:38,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:24:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:24:38,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:38,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:38,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:24:38,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:38,423 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,439 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,472 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:38,503 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 14:24:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:24:38,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:38,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:24:38,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,723 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:38,723 INFO L303 Elim1Store]: Index analysis took 133 ms [2019-01-11 14:24:38,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:24:38,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:38,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 14:24:38,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:24:38,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:38,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 14:24:38,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,002 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:39,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:24:39,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:39,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 14:24:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:39,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:39,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:39,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:24:39,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:39,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:24:39,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:24:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:39,164 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-11 14:24:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:43,842 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-11 14:24:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:43,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:24:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:43,850 INFO L225 Difference]: With dead ends: 1522 [2019-01-11 14:24:43,850 INFO L226 Difference]: Without dead ends: 1521 [2019-01-11 14:24:43,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:24:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-11 14:24:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-11 14:24:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-11 14:24:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-11 14:24:47,195 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-11 14:24:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:47,196 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-11 14:24:47,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:24:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-11 14:24:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:47,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:47,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:47,198 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-11 14:24:47,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:47,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:47,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:47,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:47,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:47,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:47,221 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-11 14:24:47,222 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:47,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:47,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:47,224 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:24:47,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:47,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:47,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:47,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:47,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:47,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:47,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:47,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:47,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:24:47,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 14:24:47,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 14:24:47,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 14:24:47,290 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:47,343 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-11 14:24:47,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 14:24:47,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 14:24:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:47,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:47,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:24:47,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:24:47,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:24:47,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:24:47,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:24:47,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:24:47,389 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-11 14:24:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:51,486 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-11 14:24:51,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:24:51,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-11 14:24:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:51,493 INFO L225 Difference]: With dead ends: 1559 [2019-01-11 14:24:51,493 INFO L226 Difference]: Without dead ends: 1554 [2019-01-11 14:24:51,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:24:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-11 14:24:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-11 14:24:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-11 14:24:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-11 14:24:55,952 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-11 14:24:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:55,952 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-11 14:24:55,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:24:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-11 14:24:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:24:55,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:55,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:24:55,954 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:55,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-11 14:24:55,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:55,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:55,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:55,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:55,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:56,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:56,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:56,023 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:24:56,023 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-11 14:24:56,024 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:56,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:56,027 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:56,027 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:24:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:56,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:56,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:56,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:56,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:56,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:56,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:56,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:24:56,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:24:56,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:24:56,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:24:56,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:24:56,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:24:56,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:24:56,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:24:56,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:24:56,341 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,355 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,369 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,386 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:56,414 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:24:56,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:24:56,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:56,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:24:56,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:24:56,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:24:56,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:24:56,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 14:24:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:56,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:56,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-01-11 14:24:56,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:56,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:24:56,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:56,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:24:56,729 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-11 14:25:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:01,193 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-11 14:25:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:01,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:25:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:01,202 INFO L225 Difference]: With dead ends: 1574 [2019-01-11 14:25:01,202 INFO L226 Difference]: Without dead ends: 1570 [2019-01-11 14:25:01,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-11 14:25:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-11 14:25:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-11 14:25:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-11 14:25:05,803 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-11 14:25:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:05,803 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-11 14:25:05,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:25:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-11 14:25:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:25:05,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:05,806 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 14:25:05,806 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:05,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-11 14:25:05,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:05,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:05,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:05,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:05,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:05,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:05,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:05,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:05,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:05,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:05,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:25:05,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:25:05,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:25:05,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:05,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:05,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:05,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:25:05,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:25:05,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:25:05,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:25:05,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,970 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:25:06,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:25:06,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:25:06,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:25:06,127 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,142 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,156 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,173 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:06,201 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:25:06,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:25:06,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:06,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 14:25:06,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:25:06,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:06,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:06,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-11 14:25:06,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,446 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:06,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:25:06,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:06,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-11 14:25:06,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:06,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 14:25:06,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:06,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:06,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-11 14:25:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:06,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:06,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:06,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:25:06,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:06,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:25:06,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:25:06,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:06,620 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-11 14:25:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:12,849 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-11 14:25:12,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:12,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:25:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:12,855 INFO L225 Difference]: With dead ends: 2098 [2019-01-11 14:25:12,855 INFO L226 Difference]: Without dead ends: 2091 [2019-01-11 14:25:12,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:25:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-11 14:25:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-11 14:25:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-11 14:25:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-11 14:25:18,387 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-11 14:25:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:18,388 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-11 14:25:18,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:25:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-11 14:25:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:25:18,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:18,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:18,390 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:18,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-11 14:25:18,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:18,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:18,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:18,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:18,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:18,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:18,444 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:25:18,444 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-11 14:25:18,445 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:18,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:18,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:18,448 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:25:18,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:18,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:18,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:18,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:18,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:18,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:18,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:18,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:25:18,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:25:18,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:25:18,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:25:18,511 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,540 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:25:18,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:25:18,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:25:18,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:25:18,696 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,711 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,742 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:18,771 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:25:18,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:25:18,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:18,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:25:18,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:18,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:18,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:25:18,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:18,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:18,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 14:25:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:18,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:19,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:19,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:25:19,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:19,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:25:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:25:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:25:19,008 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-11 14:25:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:24,170 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-11 14:25:24,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:25:24,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:25:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:24,175 INFO L225 Difference]: With dead ends: 1846 [2019-01-11 14:25:24,175 INFO L226 Difference]: Without dead ends: 1839 [2019-01-11 14:25:24,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-11 14:25:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-11 14:25:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-11 14:25:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-11 14:25:29,685 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-11 14:25:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:29,685 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-11 14:25:29,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:25:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-11 14:25:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:25:29,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:29,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:29,688 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:29,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-11 14:25:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:29,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:29,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:29,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:29,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:29,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:29,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:29,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:25:29,859 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-11 14:25:29,860 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:29,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:29,864 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:29,864 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:25:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:29,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:29,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:29,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:29,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:29,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:29,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:29,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:29,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:25:29,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:25:29,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:25:29,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:25:29,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,981 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:25:30,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:25:30,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:25:30,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:25:30,139 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,155 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,186 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:30,213 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:25:30,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:25:30,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:30,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:30,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-11 14:25:30,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-01-11 14:25:30,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-01-11 14:25:30,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:30,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-11 14:25:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,599 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:30,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-11 14:25:30,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,660 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:30,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:30,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-11 14:25:30,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:30,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:30,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 14:25:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:30,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:30,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 14:25:30,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:30,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:25:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:25:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:25:30,830 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-11 14:25:32,635 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-11 14:25:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:37,733 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-11 14:25:37,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:25:37,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:25:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:37,739 INFO L225 Difference]: With dead ends: 2193 [2019-01-11 14:25:37,739 INFO L226 Difference]: Without dead ends: 2192 [2019-01-11 14:25:37,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:25:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-11 14:25:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-11 14:25:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-11 14:25:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-11 14:25:43,625 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-11 14:25:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:43,625 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-11 14:25:43,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:25:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-11 14:25:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:25:43,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:43,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:43,629 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:43,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-11 14:25:43,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:43,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:43,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:43,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:43,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:43,781 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:25:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:43,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:43,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:43,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:43,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:43,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:43,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:43,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:25:43,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:25:43,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:25:43,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:43,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:43,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:25:43,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:25:43,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:25:43,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:43,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:25:43,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:44,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:25:44,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:25:44,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:25:44,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:25:44,406 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,429 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,442 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,453 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,462 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:44,491 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 14:25:44,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:25:44,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:44,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:25:44,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:25:44,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:44,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-11 14:25:44,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,675 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:44,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:25:44,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:44,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 14:25:44,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:44,744 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:44,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:25:44,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:44,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:44,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 14:25:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:44,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:44,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:44,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:25:44,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:44,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:44,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:44,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:44,867 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-11 14:25:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:52,273 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-11 14:25:52,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:25:52,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:25:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:52,280 INFO L225 Difference]: With dead ends: 2526 [2019-01-11 14:25:52,280 INFO L226 Difference]: Without dead ends: 2520 [2019-01-11 14:25:52,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:25:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-11 14:25:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-11 14:25:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-11 14:25:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-11 14:25:58,271 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-11 14:25:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:58,271 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-11 14:25:58,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-11 14:25:58,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:25:58,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:58,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:25:58,274 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-11 14:25:58,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:58,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:58,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:58,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:58,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:58,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:25:58,385 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-11 14:25:58,386 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:58,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:58,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:58,388 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:25:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:58,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:58,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:58,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:58,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:58,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:58,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:58,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:25:58,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:25:58,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:25:58,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:25:58,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:25:58,434 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:25:58,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:25:58,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:25:58,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:25:58,620 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,636 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,651 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,667 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:58,695 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:25:58,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:25:58,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:58,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:58,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-11 14:25:58,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,941 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:58,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:25:58,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:58,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-11 14:25:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:58,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:59,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-01-11 14:25:59,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:59,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-11 14:25:59,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:59,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:25:59,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:25:59,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:25:59,023 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-11 14:26:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:04,694 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-11 14:26:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:26:04,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 14:26:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:04,699 INFO L225 Difference]: With dead ends: 1971 [2019-01-11 14:26:04,700 INFO L226 Difference]: Without dead ends: 1964 [2019-01-11 14:26:04,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:26:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-11 14:26:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-11 14:26:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-11 14:26:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-11 14:26:10,722 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-11 14:26:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:10,722 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-11 14:26:10,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:26:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-11 14:26:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:26:10,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:10,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:10,726 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-11 14:26:10,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:10,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:10,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:10,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:10,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:10,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:10,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:26:10,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:26:10,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:10,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:10,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:26:10,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:26:10,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:26:10,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:26:10,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:10,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:26:10,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:26:10,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:26:10,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:26:10,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:26:10,839 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:10,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:10,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:10,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:10,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:10,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:26:10,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:26:10,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:26:11,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:26:11,024 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,037 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,051 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,067 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:11,096 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:26:11,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:26:11,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:11,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:26:11,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:26:11,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:11,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:26:11,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:11,244 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:11,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:26:11,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:11,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:11,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:26:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:11,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:11,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:11,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:26:11,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:11,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:26:11,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:26:11,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:26:11,343 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-11 14:26:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:17,362 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-11 14:26:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:26:17,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 14:26:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:17,368 INFO L225 Difference]: With dead ends: 2036 [2019-01-11 14:26:17,368 INFO L226 Difference]: Without dead ends: 2033 [2019-01-11 14:26:17,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-11 14:26:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-11 14:26:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-11 14:26:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-11 14:26:23,593 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-11 14:26:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:23,593 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-11 14:26:23,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:26:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-11 14:26:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:26:23,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:23,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:23,597 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-11 14:26:23,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:23,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:23,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:26:23,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:23,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:23,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:23,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:23,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:26:23,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:26:23,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:23,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:23,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:26:23,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:26:23,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:26:23,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:26:23,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:23,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:26:23,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:26:23,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:26:23,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:26:23,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:26:23,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:26:23,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:26:23,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 14:26:23,843 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,861 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,874 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,886 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:23,917 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 14:26:23,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-11 14:26:23,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:26:24,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-11 14:26:24,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-11 14:26:24,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 14:26:24,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:26:24,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,285 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:24,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-11 14:26:24,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-11 14:26:24,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-11 14:26:24,496 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-11 14:26:24,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-01-11 14:26:24,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 14:26:24,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,677 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:24,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 14:26:24,678 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,755 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:24,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-01-11 14:26:24,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-11 14:26:24,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-11 14:26:24,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,895 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:24,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-01-11 14:26:24,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 14:26:24,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:25,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,060 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:25,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-11 14:26:25,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:25,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:25,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-01-11 14:26:25,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:25,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-11 14:26:25,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-11 14:26:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:25,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:25,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:25,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:26:25,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:25,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:26:25,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:26:25,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:25,474 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-11 14:26:27,581 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-11 14:26:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:35,131 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-11 14:26:35,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:26:35,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:26:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:35,139 INFO L225 Difference]: With dead ends: 2952 [2019-01-11 14:26:35,139 INFO L226 Difference]: Without dead ends: 2951 [2019-01-11 14:26:35,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:26:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-11 14:26:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-11 14:26:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-11 14:26:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-11 14:26:40,704 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-11 14:26:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:40,704 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-11 14:26:40,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:26:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-11 14:26:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:26:40,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:40,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:40,707 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:40,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:40,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-11 14:26:40,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:40,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:26:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:40,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:40,898 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 14:26:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:40,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:40,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:40,990 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:26:40,990 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-11 14:26:40,991 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:40,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:40,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:40,992 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:26:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:40,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:40,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:40,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:41,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:41,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:41,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:41,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:26:41,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:26:41,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:26:41,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:26:41,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:26:41,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:26:41,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:26:41,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:26:41,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:26:41,195 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,217 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,230 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,240 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,250 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:41,278 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:26:41,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:26:41,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:26:41,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:26:41,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-11 14:26:41,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,523 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:41,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-01-11 14:26:41,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-11 14:26:41,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:26:41,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-11 14:26:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:41,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:41,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:41,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-11 14:26:41,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:41,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:26:41,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:26:41,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:26:41,747 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-11 14:26:42,004 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-11 14:26:42,372 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-11 14:26:42,498 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-11 14:26:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:48,433 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-11 14:26:48,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:26:48,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:26:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:48,438 INFO L225 Difference]: With dead ends: 1903 [2019-01-11 14:26:48,439 INFO L226 Difference]: Without dead ends: 1896 [2019-01-11 14:26:48,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:26:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-11 14:26:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-11 14:26:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-11 14:26:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-11 14:26:54,584 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-11 14:26:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:54,585 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-11 14:26:54,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:26:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-11 14:26:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:26:54,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:54,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:54,587 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:54,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-11 14:26:54,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:54,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:54,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:54,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:54,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:54,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:54,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:54,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:26:54,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:26:54,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:54,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:54,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:26:54,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:26:54,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:26:54,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:26:54,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:54,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:26:54,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:26:54,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:26:54,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:26:54,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:26:54,707 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:26:54,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:26:54,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:26:54,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:54,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:26:54,906 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,921 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,935 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,952 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:54,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:54,978 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:26:55,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:55,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:26:55,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:55,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:55,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:26:55,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:55,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:55,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:55,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:55,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:55,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:55,057 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:55,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:26:55,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:26:55,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:26:55,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 14:26:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:55,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:55,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:55,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:26:55,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:55,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:26:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:26:55,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:26:55,235 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-11 14:27:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:01,092 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-11 14:27:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:27:01,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:27:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:01,097 INFO L225 Difference]: With dead ends: 1884 [2019-01-11 14:27:01,097 INFO L226 Difference]: Without dead ends: 1877 [2019-01-11 14:27:01,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:27:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-11 14:27:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-11 14:27:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-11 14:27:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-11 14:27:07,375 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-11 14:27:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:07,375 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-11 14:27:07,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:27:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-11 14:27:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:27:07,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:07,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:07,380 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-11 14:27:07,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:07,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:07,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:27:07,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:07,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:07,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:07,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:07,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:27:07,552 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-11 14:27:07,553 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:27:07,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:27:07,554 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:27:07,555 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:27:07,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:07,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:27:07,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:07,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:07,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:07,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:27:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:07,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:07,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:27:07,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:27:07,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:27:07,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:07,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:27:07,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:27:07,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:27:07,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:27:07,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:27:07,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:27:07,814 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:07,836 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:08,014 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:08,078 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:08,088 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:08,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:08,117 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:27:08,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:27:08,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:08,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:08,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 14:27:08,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-11 14:27:08,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:08,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:08,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-11 14:27:08,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:08,258 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:08,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 14:27:08,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:27:08,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:27:08,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-11 14:27:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:08,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:08,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:08,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 14:27:08,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:08,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:27:08,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:27:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:27:08,467 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-11 14:27:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:17,556 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-11 14:27:17,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:27:17,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 14:27:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:17,564 INFO L225 Difference]: With dead ends: 2991 [2019-01-11 14:27:17,564 INFO L226 Difference]: Without dead ends: 2978 [2019-01-11 14:27:17,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:27:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-11 14:27:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-11 14:27:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-11 14:27:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-11 14:27:25,559 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-11 14:27:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:25,560 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-11 14:27:25,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:27:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-11 14:27:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:27:25,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:25,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:25,564 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-11 14:27:25,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:25,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:25,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:25,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:25,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:27:25,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:25,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:25,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:27:25,658 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-11 14:27:25,659 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:27:25,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:27:25,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:27:25,661 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 14:27:25,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:25,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:27:25,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:25,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:25,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:25,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:27:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:25,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:25,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:27:25,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:27:25,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:27:25,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:25,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:27:25,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:27:25,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:27:25,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:27:25,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:27:25,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:27:25,914 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,939 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,952 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,962 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:25,972 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:26,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:26,002 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 14:27:26,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:27:26,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:26,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:26,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 14:27:26,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:27:26,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:26,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:26,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 14:27:26,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,173 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:26,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 14:27:26,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:26,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:26,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 14:27:26,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,244 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:26,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 14:27:26,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:26,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:26,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-11 14:27:26,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:26,317 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:26,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 14:27:26,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:26,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:26,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-11 14:27:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:26,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:26,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:26,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 14:27:26,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:26,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:27:26,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:27:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:27:26,617 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-11 14:27:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:36,993 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-11 14:27:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:27:36,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 14:27:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:37,001 INFO L225 Difference]: With dead ends: 3181 [2019-01-11 14:27:37,001 INFO L226 Difference]: Without dead ends: 3179 [2019-01-11 14:27:37,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:27:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-11 14:27:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-11 14:27:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-11 14:27:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-11 14:27:44,959 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-11 14:27:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:44,960 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-11 14:27:44,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:27:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-11 14:27:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:27:44,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:44,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:44,963 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:44,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-11 14:27:44,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:44,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:44,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:27:45,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:27:45,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:27:45,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:27:45,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:27:45,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:27:45,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:27:45,039 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-11 14:27:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:52,265 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-11 14:27:52,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:27:52,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 14:27:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:52,271 INFO L225 Difference]: With dead ends: 2346 [2019-01-11 14:27:52,271 INFO L226 Difference]: Without dead ends: 2337 [2019-01-11 14:27:52,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:27:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-11 14:28:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-11 14:28:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-11 14:28:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-11 14:28:00,453 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-11 14:28:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:00,453 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-11 14:28:00,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:28:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-11 14:28:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:00,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:00,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:00,457 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:00,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:00,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-11 14:28:00,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:00,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:00,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:00,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:00,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:28:00,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:00,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:00,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:28:00,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:28:00,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:00,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:00,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:28:00,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:28:00,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:28:00,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:28:00,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:00,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:28:00,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:28:00,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:28:00,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:28:00,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:00,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:28:00,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:28:00,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:28:00,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:28:00,846 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,869 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,883 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,894 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,904 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:00,934 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 14:28:00,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:00,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:28:00,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:01,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:01,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 14:28:01,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:28:01,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:01,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:01,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 14:28:01,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,344 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:01,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,371 INFO L303 Elim1Store]: Index analysis took 271 ms [2019-01-11 14:28:01,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 14:28:01,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:01,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:01,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-11 14:28:01,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,457 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:01,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 14:28:01,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:01,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:01,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:28:01,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:01,530 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:01,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 14:28:01,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:01,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:01,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-11 14:28:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:01,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:01,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:01,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 14:28:01,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:01,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:28:01,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:28:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:28:01,707 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-11 14:28:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:09,794 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-11 14:28:09,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:28:09,795 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 14:28:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:09,801 INFO L225 Difference]: With dead ends: 2345 [2019-01-11 14:28:09,801 INFO L226 Difference]: Without dead ends: 2338 [2019-01-11 14:28:09,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:28:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-11 14:28:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-11 14:28:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-11 14:28:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-11 14:28:12,073 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-11 14:28:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:12,074 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-11 14:28:12,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:28:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-11 14:28:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:12,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:12,075 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:12,075 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:12,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-11 14:28:12,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:12,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:28:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:12,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:28:12,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:12,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:12,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:28:12,151 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-11 14:28:12,152 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:12,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:12,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:12,154 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:28:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:12,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:12,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:12,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:12,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:12,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:12,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:12,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:12,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:28:12,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:28:12,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:28:12,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:28:12,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:28:12,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:28:12,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,422 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-11 14:28:12,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:28:12,423 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,429 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:12,458 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 14:28:12,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:28:12,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-11 14:28:12,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:28:12,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-11 14:28:12,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-11 14:28:12,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:12,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-11 14:28:12,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:12,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-11 14:28:12,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:12,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:12,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-11 14:28:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:12,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:12,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:12,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:28:12,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:12,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:28:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:28:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:28:12,688 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-11 14:28:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:15,024 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-11 14:28:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:28:15,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 14:28:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:15,026 INFO L225 Difference]: With dead ends: 480 [2019-01-11 14:28:15,026 INFO L226 Difference]: Without dead ends: 477 [2019-01-11 14:28:15,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:28:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-11 14:28:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-11 14:28:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-11 14:28:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-11 14:28:15,974 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-11 14:28:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:15,974 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-11 14:28:15,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:28:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-11 14:28:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:15,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:15,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:15,975 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:15,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-11 14:28:15,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:15,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:15,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:15,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:15,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:28:16,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:16,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:16,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:28:16,029 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 14:28:16,030 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:16,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:16,032 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:16,032 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:28:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:16,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:16,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:16,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:16,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:16,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:16,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:16,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:16,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:28:16,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:28:16,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:28:16,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:28:16,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:28:16,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:28:16,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:28:16,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:28:16,246 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,260 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,273 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,288 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:16,314 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:28:16,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:28:16,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:16,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:28:16,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:28:16,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:16,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:28:16,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:16,435 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:16,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-11 14:28:16,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:16,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:16,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:28:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:16,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:16,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:16,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:28:16,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:16,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:28:16,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:28:16,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:28:16,522 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-11 14:28:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:18,358 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-11 14:28:18,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:28:18,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:28:18,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:18,360 INFO L225 Difference]: With dead ends: 250 [2019-01-11 14:28:18,360 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 14:28:18,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:28:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 14:28:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-11 14:28:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-11 14:28:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-11 14:28:19,933 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-11 14:28:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:19,934 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-11 14:28:19,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:28:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-11 14:28:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:19,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:19,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:19,935 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-11 14:28:19,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:19,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:19,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:20,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-01-11 14:28:20,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:20,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:20,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:28:20,035 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-11 14:28:20,035 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:20,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:20,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:20,038 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:28:20,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:20,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:20,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:20,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:20,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:20,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:20,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:20,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:20,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:28:20,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:28:20,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:28:20,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 14:28:20,078 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:28:20,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:28:20,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:28:20,184 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,192 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,200 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:20,218 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 14:28:20,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:28:20,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-11 14:28:20,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:28:20,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:20,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-11 14:28:20,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:20,309 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:20,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-11 14:28:20,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:20,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:20,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-11 14:28:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:20,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:20,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:20,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:28:20,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:20,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:28:20,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:28:20,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:28:20,385 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-11 14:28:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:23,517 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-11 14:28:23,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:28:23,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:28:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:23,519 INFO L225 Difference]: With dead ends: 372 [2019-01-11 14:28:23,519 INFO L226 Difference]: Without dead ends: 362 [2019-01-11 14:28:23,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:28:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-11 14:28:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-11 14:28:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-11 14:28:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-11 14:28:25,899 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-11 14:28:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:25,900 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-11 14:28:25,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:28:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-11 14:28:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:25,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:25,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:25,901 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-11 14:28:25,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:25,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:25,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:25,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:25,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:25,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:25,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:25,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:28:25,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:28:25,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:25,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:25,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:28:25,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:28:25,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:28:25,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:28:25,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:26,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:26,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:28:26,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:28:26,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:28:26,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:28:26,029 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:28:26,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:28:26,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:28:26,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:28:26,198 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,212 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,225 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,240 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:26,266 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:28:26,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:28:26,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:26,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:28:26,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,341 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:26,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:28:26,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:28:26,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:28:26,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 14:28:26,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:26,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:28:26,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:26,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:26,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-11 14:28:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:26,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:26,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:26,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:28:26,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:26,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:28:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:28:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:28:26,578 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-11 14:28:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:29,433 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-11 14:28:29,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:28:29,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:28:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:29,435 INFO L225 Difference]: With dead ends: 332 [2019-01-11 14:28:29,435 INFO L226 Difference]: Without dead ends: 325 [2019-01-11 14:28:29,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:28:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-11 14:28:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-11 14:28:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-11 14:28:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-11 14:28:31,892 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-11 14:28:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:31,893 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-11 14:28:31,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:28:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-11 14:28:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:31,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:31,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:31,894 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-11 14:28:31,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:31,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:31,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:28:31,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:31,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:28:31,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:31,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:31,960 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:28:31,960 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-11 14:28:31,961 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:31,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:31,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:31,963 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:28:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:31,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:31,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:31,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:31,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:31,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:31,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:31,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:28:32,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:28:32,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:28:32,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:28:32,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:32,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:28:32,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:28:32,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:28:32,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:28:32,162 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,186 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,199 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,209 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:32,249 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:28:32,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:28:32,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:32,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:28:32,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,346 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:32,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:28:32,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:32,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 14:28:32,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:32,396 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:32,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:28:32,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:32,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:32,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 14:28:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:32,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:32,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:32,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:28:32,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:32,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:28:32,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:28:32,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:28:32,517 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-11 14:28:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:35,105 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-11 14:28:35,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:28:35,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:28:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:35,107 INFO L225 Difference]: With dead ends: 294 [2019-01-11 14:28:35,107 INFO L226 Difference]: Without dead ends: 287 [2019-01-11 14:28:35,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:28:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-11 14:28:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-11 14:28:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-11 14:28:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-11 14:28:37,543 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-11 14:28:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:37,544 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-11 14:28:37,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:28:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-11 14:28:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:37,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:37,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:37,545 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:37,545 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-11 14:28:37,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:37,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:37,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:37,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:37,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:28:37,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:37,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:37,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:28:37,650 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-11 14:28:37,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:37,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:37,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:37,652 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:28:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:37,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:37,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:37,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:37,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:37,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:37,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:37,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:37,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:28:37,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:28:37,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:28:37,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:28:37,710 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,757 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:28:37,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:28:37,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:28:37,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:28:37,877 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,904 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,919 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:37,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:37,945 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:28:37,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:37,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:28:37,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:38,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:38,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 14:28:38,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:28:38,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:28:38,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:28:38,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-11 14:28:38,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,244 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:38,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-01-11 14:28:38,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:38,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:38,303 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:38,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 14:28:38,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:38,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:28:38,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-11 14:28:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:38,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:38,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:38,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 14:28:38,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:38,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:28:38,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:28:38,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:28:38,470 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-11 14:28:38,924 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-11 14:28:40,151 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-11 14:28:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:43,198 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-11 14:28:43,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:28:43,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 14:28:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:43,200 INFO L225 Difference]: With dead ends: 364 [2019-01-11 14:28:43,200 INFO L226 Difference]: Without dead ends: 357 [2019-01-11 14:28:43,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:28:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-11 14:28:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-11 14:28:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-11 14:28:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-11 14:28:45,822 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-11 14:28:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:45,823 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-11 14:28:45,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:28:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-11 14:28:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:45,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:45,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:45,824 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-11 14:28:45,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:45,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:45,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:46,193 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-01-11 14:28:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:28:46,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:46,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:46,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:28:46,284 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 14:28:46,285 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:46,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:46,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:46,287 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:28:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:46,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:46,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:46,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:46,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:46,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:46,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:46,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:28:46,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:28:46,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:28:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:28:46,353 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:28:46,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:28:46,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:28:46,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:28:46,521 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,535 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,548 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,563 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:46,589 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:28:46,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:28:46,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:46,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:28:46,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:28:46,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:46,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 14:28:46,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:46,726 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:46,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:28:46,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:46,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:46,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:28:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:46,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:46,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-01-11 14:28:46,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:46,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:28:46,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:46,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:28:46,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:28:46,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:28:46,818 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-11 14:28:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:49,850 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-11 14:28:49,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:28:49,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:28:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:49,852 INFO L225 Difference]: With dead ends: 319 [2019-01-11 14:28:49,852 INFO L226 Difference]: Without dead ends: 312 [2019-01-11 14:28:49,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:28:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-11 14:28:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-11 14:28:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-11 14:28:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-11 14:28:52,828 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-11 14:28:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:52,828 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-11 14:28:52,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:28:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-11 14:28:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:28:52,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:52,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:52,829 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:52,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:52,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-11 14:28:52,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:52,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:52,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:28:52,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:52,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:52,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:28:52,943 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-11 14:28:52,944 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:52,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:52,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:52,946 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:28:52,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:52,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:52,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:52,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:52,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:52,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:52,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:28:52,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:52,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:52,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:28:53,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:28:53,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:28:53,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:28:53,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:28:53,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:28:53,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:28:53,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:28:53,152 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,174 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,186 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,195 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,204 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:53,230 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:28:53,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:28:53,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:28:53,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:28:53,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 14:28:53,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-11 14:28:53,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-11 14:28:53,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:28:53,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-11 14:28:53,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,610 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:53,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 14:28:53,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,670 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:53,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:53,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-11 14:28:53,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:53,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:28:53,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 14:28:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:53,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:53,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:53,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 14:28:53,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:53,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:28:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:28:53,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:28:53,815 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-11 14:28:54,014 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-11 14:28:55,135 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-11 14:28:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:58,130 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-11 14:28:58,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:28:58,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 14:28:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:58,132 INFO L225 Difference]: With dead ends: 392 [2019-01-11 14:28:58,132 INFO L226 Difference]: Without dead ends: 386 [2019-01-11 14:28:58,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:28:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-11 14:29:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-11 14:29:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-11 14:29:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-11 14:29:01,367 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-11 14:29:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:29:01,367 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-11 14:29:01,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:29:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-11 14:29:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:29:01,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:29:01,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:29:01,368 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:29:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-11 14:29:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:29:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:01,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:29:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:29:01,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:29:01,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:29:01,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:29:01,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:29:01,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:29:01,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:29:01,442 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-11 14:29:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:29:04,359 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-11 14:29:04,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:29:04,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 14:29:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:29:04,361 INFO L225 Difference]: With dead ends: 320 [2019-01-11 14:29:04,361 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 14:29:04,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:29:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 14:29:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-11 14:29:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-11 14:29:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-11 14:29:07,629 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-11 14:29:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:29:07,629 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-11 14:29:07,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:29:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-11 14:29:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:29:07,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:29:07,630 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:29:07,630 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:29:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-11 14:29:07,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:29:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:07,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:07,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:29:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:29:07,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:07,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:29:07,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:29:07,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:29:07,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:07,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:29:07,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:29:07,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:29:07,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:29:07,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:29:07,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:29:07,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:29:07,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:29:07,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:29:07,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:07,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:29:07,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:29:07,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:29:07,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:29:07,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:29:07,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:29:07,900 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,922 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,933 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,942 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:07,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:07,977 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:29:08,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:29:08,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:08,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:08,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 14:29:08,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-11 14:29:08,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:08,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:08,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-11 14:29:08,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:29:08,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:29:08,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:29:08,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-11 14:29:08,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:08,280 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:29:08,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-11 14:29:08,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:08,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:08,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:29:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:08,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:29:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:08,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:29:08,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:29:08,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:29:08,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:29:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:29:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:29:08,405 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-11 14:29:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:29:14,713 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-11 14:29:14,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:29:14,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:29:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:29:14,714 INFO L225 Difference]: With dead ends: 601 [2019-01-11 14:29:14,715 INFO L226 Difference]: Without dead ends: 591 [2019-01-11 14:29:14,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:29:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-11 14:29:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-11 14:29:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-11 14:29:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-11 14:29:19,977 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-11 14:29:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:29:19,977 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-11 14:29:19,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:29:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-11 14:29:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:29:19,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:29:19,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:29:19,979 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:29:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:19,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-11 14:29:19,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:29:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:19,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:29:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:19,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:29:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:29:20,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:20,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:29:20,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:29:20,061 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 14:29:20,061 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:29:20,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:29:20,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:29:20,064 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:29:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:20,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:29:20,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:20,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:29:20,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:20,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:29:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:20,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:29:20,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:29:20,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:29:20,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:29:20,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:29:20,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:29:20,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:29:20,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:29:20,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:29:20,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:29:20,317 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,337 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,348 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,357 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:20,392 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:29:20,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:29:20,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:20,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:29:20,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-11 14:29:20,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:20,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:20,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-11 14:29:20,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,560 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:29:20,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:20,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 14:29:20,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:29:20,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:29:20,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-11 14:29:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:20,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:29:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:20,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:29:20,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:29:20,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:29:20,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:29:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:29:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:29:20,752 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-11 14:29:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:29:30,375 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-11 14:29:30,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:29:30,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 14:29:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:29:30,377 INFO L225 Difference]: With dead ends: 731 [2019-01-11 14:29:30,378 INFO L226 Difference]: Without dead ends: 718 [2019-01-11 14:29:30,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:29:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-11 14:29:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-11 14:29:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-11 14:29:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-11 14:29:39,188 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-11 14:29:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:29:39,188 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-11 14:29:39,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:29:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-11 14:29:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:29:39,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:29:39,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:29:39,189 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:29:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:39,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-11 14:29:39,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:29:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:39,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:29:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:29:39,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:39,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:29:39,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:29:39,281 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 14:29:39,282 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:29:39,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:29:39,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:29:39,284 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:29:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:39,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:29:39,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:39,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:29:39,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:39,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:29:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:39,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:29:39,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:29:39,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:29:39,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:29:39,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:29:39,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:29:39,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:29:39,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:29:39,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:29:39,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:29:39,493 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,546 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,557 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,566 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,575 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:39,601 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:29:39,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:29:39,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-11 14:29:39,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:29:39,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:39,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-11 14:29:39,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,743 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:29:39,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:29:39,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:39,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-11 14:29:39,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:39,796 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:29:39,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-11 14:29:39,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:39,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:39,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-11 14:29:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:39,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:29:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:39,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:29:39,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:29:39,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:29:39,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:29:39,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:29:39,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:29:39,959 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-11 14:29:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:29:49,870 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-11 14:29:49,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:29:49,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:29:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:29:49,872 INFO L225 Difference]: With dead ends: 480 [2019-01-11 14:29:49,872 INFO L226 Difference]: Without dead ends: 473 [2019-01-11 14:29:49,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:29:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-11 14:29:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-11 14:29:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-11 14:29:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-11 14:29:53,243 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-11 14:29:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:29:53,243 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-11 14:29:53,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:29:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-11 14:29:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:29:53,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:29:53,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:29:53,245 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:29:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:53,245 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-11 14:29:53,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:29:53,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:53,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:53,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:53,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:29:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:29:53,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:53,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:29:53,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:29:53,344 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 14:29:53,345 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:29:53,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:29:53,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:29:53,348 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:29:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:53,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:29:53,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:53,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:29:53,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:53,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:29:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:53,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:29:53,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:29:53,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:29:53,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:29:53,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:29:53,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:29:53,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,425 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:29:53,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:29:53,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:29:53,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:29:53,568 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,582 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,595 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:53,636 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:29:53,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:29:53,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:53,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:29:53,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:29:53,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:53,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:29:53,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,770 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:29:53,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:53,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 14:29:53,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:53,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:53,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:29:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:53,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:29:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:53,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:29:53,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:29:53,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:29:53,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:29:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:29:53,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:29:53,865 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-11 14:29:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:29:59,105 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-11 14:29:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:29:59,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 14:29:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:29:59,107 INFO L225 Difference]: With dead ends: 258 [2019-01-11 14:29:59,107 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 14:29:59,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:29:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 14:30:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-11 14:30:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-11 14:30:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-11 14:30:03,745 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-11 14:30:03,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:30:03,745 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-11 14:30:03,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:30:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-11 14:30:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:30:03,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:30:03,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:30:03,746 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:30:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:03,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-11 14:30:03,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:30:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:03,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:30:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:30:03,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:03,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:30:03,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:30:03,891 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 14:30:03,892 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:30:03,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:30:03,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:30:03,895 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:30:03,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:03,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:30:03,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:03,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:30:03,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:03,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:30:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:03,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:30:03,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:30:03,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:30:03,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:30:03,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:30:03,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:03,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:30:03,938 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:03,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:03,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:03,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:03,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:30:04,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:30:04,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:30:04,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:30:04,117 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,131 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,144 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,159 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,184 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-11 14:30:04,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:30:04,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:04,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-11 14:30:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,284 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:04,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:30:04,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:30:04,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:30:04,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-11 14:30:04,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,426 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:04,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-11 14:30:04,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-01-11 14:30:04,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:30:04,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-11 14:30:04,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,596 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:04,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-11 14:30:04,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:04,677 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:04,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-11 14:30:04,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:04,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:30:04,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-11 14:30:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:04,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:30:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:04,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:30:04,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:30:04,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:30:04,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:30:04,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:30:04,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:30:04,827 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-11 14:30:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:30:11,019 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-11 14:30:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:30:11,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:30:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:30:11,021 INFO L225 Difference]: With dead ends: 295 [2019-01-11 14:30:11,021 INFO L226 Difference]: Without dead ends: 284 [2019-01-11 14:30:11,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:30:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-11 14:30:15,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-11 14:30:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 14:30:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-11 14:30:15,884 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-11 14:30:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:30:15,885 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-11 14:30:15,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:30:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-11 14:30:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:30:15,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:30:15,885 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:30:15,886 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:30:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:15,886 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-11 14:30:15,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:30:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:15,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:15,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:15,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:30:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:30:16,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:16,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:30:16,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:30:16,053 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-11 14:30:16,053 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:30:16,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:30:16,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:30:16,055 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:30:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:16,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:30:16,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30: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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:30:16,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:16,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:30:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:16,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:30:16,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:30:16,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:30:16,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:30:16,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:30:16,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:30:16,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,122 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,146 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:30:16,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:30:16,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:30:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:30:16,267 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,281 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,312 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,327 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:16,353 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 14:30:16,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:30:16,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:16,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:30:16,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:30:16,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:30:16,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:30:16,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 14:30:16,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:16,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:30:16,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:16,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:16,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-11 14:30:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:16,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:30:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:16,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:30:16,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:30:16,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:30:16,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:30:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:30:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:30:16,655 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-11 14:30:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:30:23,518 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-11 14:30:23,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:30:23,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 14:30:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:30:23,520 INFO L225 Difference]: With dead ends: 328 [2019-01-11 14:30:23,520 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 14:30:23,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:30:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 14:30:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-11 14:30:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-11 14:30:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-11 14:30:30,496 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-11 14:30:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:30:30,496 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-11 14:30:30,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:30:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-11 14:30:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:30:30,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:30:30,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:30:30,497 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:30:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-11 14:30:30,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:30:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:30,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:30,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:30,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:30:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:30:30,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:30,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:30:30,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:30:30,599 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-11 14:30:30,599 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:30:30,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:30:30,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:30:30,601 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:30:30,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:30,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:30:30,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:30,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:30:30,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:30,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:30:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:30,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:30:30,810 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-11 14:30:30,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:30:30,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:30:30,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:30:30,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:30,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:30:30,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:30,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:30,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:30:31,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:30:31,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:30:31,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:30:31,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:30:31,040 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,063 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,076 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,086 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:31,123 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 14:30:31,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:30:31,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:31,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:30:31,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 14:30:31,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:31,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 14:30:31,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,283 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:31,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:31,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 14:30:31,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:31,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:31,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 14:30:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:31,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:30:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:31,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:30:31,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:30:31,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:30:31,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:30:31,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:30:31,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:30:31,400 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-11 14:30:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:30:40,651 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-11 14:30:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:30:40,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 14:30:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:30:40,653 INFO L225 Difference]: With dead ends: 326 [2019-01-11 14:30:40,653 INFO L226 Difference]: Without dead ends: 313 [2019-01-11 14:30:40,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:30:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-11 14:30:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-11 14:30:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-11 14:30:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-11 14:30:49,021 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-11 14:30:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:30:49,021 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-11 14:30:49,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:30:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-11 14:30:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:30:49,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:30:49,022 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:30:49,022 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:30:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-11 14:30:49,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:30:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:49,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:49,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:30:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:30:49,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:49,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:30:49,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:30:49,124 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 14:30:49,125 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:30:49,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:30:49,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:30:49,127 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:30:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:49,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:30:49,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:49,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:30:49,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:49,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:30:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:49,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:30:49,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:30:49,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:30:49,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:30:49,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,415 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-11 14:30:49,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:30:49,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:30:49,484 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,508 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:30:49,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:30:49,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:30:49,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:30:49,652 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,666 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,679 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,694 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:49,720 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:30:49,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:30:49,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:30:49,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:30:49,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 14:30:49,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,887 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:49,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-11 14:30:49,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:49,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-11 14:30:49,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:30:49,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:49,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 14:30:49,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-11 14:30:49,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:50,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:50,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-11 14:30:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:50,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:30:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:50,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:30:50,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:30:50,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:30:50,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:30:50,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:30:50,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:30:50,088 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-11 14:31:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:31:01,416 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-11 14:31:01,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:31:01,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 14:31:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:31:01,418 INFO L225 Difference]: With dead ends: 400 [2019-01-11 14:31:01,418 INFO L226 Difference]: Without dead ends: 393 [2019-01-11 14:31:01,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:31:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-11 14:31:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-11 14:31:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-11 14:31:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-11 14:31:12,134 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-11 14:31:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:31:12,134 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-11 14:31:12,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:31:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-11 14:31:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:31:12,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:31:12,135 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:31:12,135 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:31:12,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:31:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-11 14:31:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:31:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:31:12,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:31:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:31:12,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:31:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:31:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:31:12,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:31:12,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:31:12,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:31:12,232 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-11 14:31:12,232 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:31:12,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:31:12,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:31:12,235 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:31:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:31:12,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:31:12,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:31:12,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:31:12,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:31:12,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:31:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:31:12,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:31:12,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:31:12,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:31:12,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:31:12,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:31:12,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:31:12,298 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:31:12,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:31:12,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:31:12,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:31:12,467 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,481 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,494 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,509 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:31:12,535 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 14:31:12,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:31:12,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:31:12,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:31:12,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-11 14:31:12,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,727 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:12,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-01-11 14:31:12,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:12,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-01-11 14:31:12,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:31:12,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-11 14:31:12,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-01-11 14:31:12,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:12,933 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:12,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 14:31:12,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:12,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:31:12,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-11 14:31:13,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-01-11 14:31:13,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:13,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:13,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-11 14:31:13,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:13,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:31:13,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-11 14:31:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:31:13,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:31:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:31:13,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:31:13,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:31:13,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:31:13,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:31:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:31:13,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:31:13,238 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-11 14:31:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:31:25,639 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-11 14:31:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:31:25,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 14:31:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:31:25,641 INFO L225 Difference]: With dead ends: 441 [2019-01-11 14:31:25,642 INFO L226 Difference]: Without dead ends: 428 [2019-01-11 14:31:25,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:31:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-11 14:31:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-11 14:31:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 14:31:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-11 14:31:36,166 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-11 14:31:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:31:36,166 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-11 14:31:36,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:31:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-11 14:31:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:31:36,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:31:36,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:31:36,167 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:31:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:31:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-11 14:31:36,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:31:36,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:31:36,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:31:36,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:31:36,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:31:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:31:36,383 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-11 14:31:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:31:36,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:31:36,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:31:36,462 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:31:36,462 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 14:31:36,463 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:31:36,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:31:36,464 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:31:36,464 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:31:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:31:36,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:31:36,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:31:36,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:31:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:31:36,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:31:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:31:36,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:31:36,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:31:36,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:31:36,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:31:36,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:31:36,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:31:36,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,533 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:31:36,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:31:36,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:31:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:31:36,676 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,703 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,718 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:36,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:31:36,744 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:31:36,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:31:36,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:31:36,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:31:36,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 14:31:36,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:36,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-01-11 14:31:36,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:37,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-01-11 14:31:37,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:37,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:31:37,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-11 14:31:37,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:37,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-11 14:31:37,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:37,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,171 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:37,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-11 14:31:37,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:37,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:31:37,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-11 14:31:37,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,265 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:37,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-01-11 14:31:37,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:37,327 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:37,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-01-11 14:31:37,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:37,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:31:37,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-11 14:31:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:31:37,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:31:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:31:37,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:31:37,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:31:37,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:31:37,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:31:37,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:31:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:31:37,519 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-11 14:31:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:31:57,464 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-11 14:31:57,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:31:57,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:31:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:31:57,466 INFO L225 Difference]: With dead ends: 685 [2019-01-11 14:31:57,466 INFO L226 Difference]: Without dead ends: 677 [2019-01-11 14:31:57,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:31:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-11 14:32:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-11 14:32:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-11 14:32:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-11 14:32:13,528 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-11 14:32:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:32:13,528 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-11 14:32:13,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:32:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-11 14:32:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:32:13,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:32:13,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:32:13,529 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:32:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-11 14:32:13,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:32:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:13,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:13,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:32:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:13,805 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-11 14:32:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:32:13,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:13,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:32:13,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:32:13,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:32:13,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:13,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:32:13,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:32:13,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:32:13,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:32:13,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:32:13,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:32:13,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:32:13,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:13,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:13,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:32:13,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:13,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:13,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:13,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:13,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:32:13,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:32:14,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:32:14,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:32:14,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:32:14,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:32:14,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:32:14,080 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,101 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,112 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,121 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,131 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:14,157 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:32:14,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:32:14,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:32:14,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:14,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 14:32:14,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-11 14:32:14,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,438 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:14,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-11 14:32:14,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:14,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-11 14:32:14,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,545 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:14,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-11 14:32:14,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-01-11 14:32:14,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:14,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-11 14:32:14,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-11 14:32:14,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:14,767 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:14,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-01-11 14:32:14,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:14,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:14,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-11 14:32:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:14,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:32:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:14,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:32:14,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 14:32:14,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:32:14,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:32:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:32:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:32:14,941 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-11 14:32:15,193 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-01-11 14:32:16,515 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-11 14:32:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:32:30,011 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-11 14:32:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:32:30,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-11 14:32:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:32:30,013 INFO L225 Difference]: With dead ends: 550 [2019-01-11 14:32:30,013 INFO L226 Difference]: Without dead ends: 543 [2019-01-11 14:32:30,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:32:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-11 14:32:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-11 14:32:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 14:32:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-11 14:32:33,121 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-11 14:32:33,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:32:33,121 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-11 14:32:33,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:32:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-11 14:32:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:32:33,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:32:33,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:32:33,122 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:32:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-11 14:32:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:32:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:33,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:32:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:33,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:32:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:33,270 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-11 14:32:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:32:33,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:33,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:32:33,313 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 14:32:33,313 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 14:32:33,314 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:32:33,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:32:33,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:32:33,316 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:32:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:33,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:32:33,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:33,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:32:33,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:33,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:32:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:33,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:32:33,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:32:33,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:32:33,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:32:33,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:33,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:32:33,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:33,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:33,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:33,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:33,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:32:33,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:32:33,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 14:32:33,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 14:32:33,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 14:32:33,570 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:33,941 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,135 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,276 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,422 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:34,801 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 14:32:35,022 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-11 14:32:35,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:32:35,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:35,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:32:35,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:32:35,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:35,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 14:32:35,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,152 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:35,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 14:32:35,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:35,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 14:32:35,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,398 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:35,399 INFO L303 Elim1Store]: Index analysis took 187 ms [2019-01-11 14:32:35,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 14:32:35,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:35,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 14:32:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:35,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:32:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:35,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:32:35,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 14:32:35,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:32:35,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:32:35,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:32:35,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:32:35,814 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-11 14:32:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:32:41,711 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-11 14:32:41,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:32:41,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 14:32:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:32:41,712 INFO L225 Difference]: With dead ends: 67 [2019-01-11 14:32:41,712 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 14:32:41,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:32:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 14:32:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-11 14:32:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 14:32:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-11 14:32:44,992 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-11 14:32:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:32:44,992 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-11 14:32:44,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:32:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-11 14:32:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:32:44,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:32:44,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:32:44,993 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:32:44,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:44,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-11 14:32:44,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:32:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:44,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:44,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:32:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 14:32:45,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:45,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:32:45,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 14:32:45,128 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 14:32:45,129 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:32:45,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:32:45,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:32:45,130 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:32:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:45,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:32:45,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:45,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:32:45,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:45,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:32:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:45,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:32:45,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:32:45,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:32:45,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:32:45,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:32:45,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:32:45,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:32:45,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:32:45,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:32:45,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:32:45,316 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,335 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,346 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,355 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,390 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-11 14:32:45,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:32:45,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:45,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-11 14:32:45,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:32:45,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:32:45,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:45,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-11 14:32:45,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,642 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:45,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 14:32:45,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,701 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:45,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-01-11 14:32:45,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:45,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-11 14:32:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,812 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:45,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-01-11 14:32:45,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:45,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:45,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-11 14:32:45,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:45,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:45,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-11 14:32:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:45,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:32:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:46,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:32:46,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:32:46,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:32:46,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:32:46,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:32:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:32:46,050 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-11 14:32:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:32:52,368 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-11 14:32:52,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:32:52,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-11 14:32:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:32:52,369 INFO L225 Difference]: With dead ends: 74 [2019-01-11 14:32:52,369 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 14:32:52,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:32:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 14:32:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-11 14:32:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 14:32:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-11 14:32:55,976 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-11 14:32:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:32:55,976 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-11 14:32:55,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:32:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-11 14:32:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:32:55,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:32:55,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:32:55,977 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:32:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-11 14:32:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:32:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:55,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:55,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:32:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:32:56,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:56,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:32:56,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 14:32:56,125 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 14:32:56,126 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:32:56,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:32:56,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:32:56,129 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:32:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:56,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:32:56,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:56,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:32:56,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:56,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:32:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:56,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:32:56,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:32:56,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:32:56,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:32:56,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:32:56,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:32:56,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:32:56,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 14:32:56,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 14:32:56,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 14:32:56,320 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,340 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,351 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,360 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,370 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:56,396 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 14:32:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:32:56,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:56,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:32:56,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:32:56,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:56,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 14:32:56,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,609 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:56,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 14:32:56,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:56,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:32:56,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,662 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:56,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:32:56,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:56,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 14:32:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:56,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:32:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:56,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:32:56,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 14:32:56,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:32:56,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:32:56,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:32:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:32:56,765 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-11 14:33:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:33:03,976 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-11 14:33:03,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:33:03,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 14:33:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:33:03,977 INFO L225 Difference]: With dead ends: 80 [2019-01-11 14:33:03,977 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 14:33:03,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:33:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 14:33:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-11 14:33:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 14:33:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-11 14:33:10,494 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-11 14:33:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:33:10,495 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-11 14:33:10,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:33:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-11 14:33:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 14:33:10,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:33:10,495 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:33:10,495 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:33:10,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:33:10,495 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-11 14:33:10,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:33:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:33:10,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:33:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:33:10,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:33:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:33:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-11 14:33:10,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:33:10,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:33:10,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:33:10,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:33:10,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:33:10,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:33:10,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:33:10,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:33:10,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:33:10,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:33:10,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:33:10,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 14:33:10,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 14:33:10,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 14:33:10,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 14:33:10,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:33:10,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,675 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-11 14:33:10,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-11 14:33:10,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-11 14:33:10,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-11 14:33:10,743 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,750 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,757 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,763 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:33:10,779 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-11 14:33:10,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:33:10,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:33:10,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 14:33:10,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-11 14:33:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 14:33:10,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-11 14:33:10,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:10,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 14:33:10,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-11 14:33:10,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:10,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-11 14:33:10,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:11,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 14:33:11,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:11,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:33:11,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-11 14:33:11,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 14:33:11,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:11,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-11 14:33:11,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:11,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:33:11,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-11 14:33:11,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,138 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:33:11,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-01-11 14:33:11,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:11,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:11,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 14:33:11,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:11,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:33:11,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-11 14:33:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:33:11,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:33:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:33:11,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:33:11,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 14:33:11,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:33:11,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:33:11,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:33:11,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:33:11,303 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-11 14:33:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:33:18,137 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-11 14:33:18,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:33:18,137 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-11 14:33:18,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:33:18,137 INFO L225 Difference]: With dead ends: 71 [2019-01-11 14:33:18,138 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:33:18,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:33:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:33:18,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:33:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:33:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:33:18,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-11 14:33:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:33:18,139 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:33:18,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:33:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:33:18,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:33:18,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:33:18,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:18,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:18,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:18,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:23,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:30,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:32,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:33,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:33,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:35,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:33:54,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:34:06,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent.